ﻻ يوجد ملخص باللغة العربية
We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for N = 2^26.
We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.
We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a superelliptic c
We prove general Dwork-type congruences for Hasse--Witt matrices attached to tuples of Laurent polynomials. We apply this result to establishing arithmetic and $p$-adic analytic properties of functions originating from polynomial solutions modulo $p^
We analyze the distribution of unitarized L-polynomials Lp(T) (as p varies) obtained from a hyperelliptic curve of genus g <= 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on the Katz-Sar