Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time
arXiv:1402.3246 · doi:10.1112/S1461157014000187
Abstract
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.
17 pages
References in corpus (1)
Cited by in corpus (20)
- A database of genus 2 curves over the rational numbers
- On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
- Hasse-Witt and Cartier-Manin matrices: A warning and a request
- Computing the geometric endomorphism ring of a genus 2 Jacobian
- Sato-Tate groups of y^2=x^8+c and y^2=x^7-cx
- A database of nonhyperelliptic genus 3 curves over Q
- Sato-Tate distributions of twists of the Fermat and the Klein quartics
- Fast Jacobian arithmetic for hyperelliptic curves of genus 3
- Maps between curves and arithmetic obstructions
- Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in -adic cohomology
- Computing representation matrices for the action of Frobenius to cohomology groups
- Computing L-Polynomials of Picard curves from Cartier-Manin matrices
- Sato-Tate Distributions of and
- An Exploration of Degeneracy in Abelian Varieties of Fermat Type
- Counting points on smooth plane quartics
- The twisting Sato-Tate group of the curve
- Hypergeometric L-functions in average polynomial time
- Local-to-Global Extensions to Wildly Ramified Covers of Curves
- Sato-Tate groups of genus 2 curves
- Computation of the divided Frobenius modulo p on the cristalline cohomology of some covering of the porjective line