Counting points on superelliptic curves in average polynomial time
From MaRDI portal
(Redirected from Publication:5853812)
Abstract: We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over that is substantially faster than previous approaches. Our algorithm takes as input a superelliptic curves with and any squarefree polynomial of degree , along with a positive integer . It can compute for all not dividing in time . It achieves this by computing the trace of the Cartier--Manin matrix of reductions of . We can also compute the Cartier--Manin matrix itself, which determines the -rank of the Jacobian of and the numerator of its zeta function modulo~.
Recommendations
Cites work
- A database of genus-2 curves over the rational numbers
- A formula for the Cartier operator on plane algebraic curves.
- A point counting algorithm for cyclic covers of the projective line
- Algebraic Function Fields and Codes
- An Arithmetic Theory of Adjoint Plane Curves
- Arithmetic invariants from Sato-Tate moments
- Computing L-functions and semistable reduction of superelliptic curves
- Computing L-series of geometrically hyperelliptic curves of genus three
- Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time
- Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time. II
- Computing period matrices and the Abel-Jacobi map of superelliptic curves
- Computing zeta functions of cyclic covers in large characteristic
- Computing zeta functions of superelliptic curves in larger characteristic
- Endomorphism algebras of abelian varieties with special reference to superelliptic Jacobians
- Hasse-Witt and Cartier-Manin matrices: a warning and a request
- scientific article; zbMATH DE number 3070524 (Why is no real title available?)
- Lectures on N_X(p)
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Modern computer algebra
- On the inversion of the Vandermonde matrix
- Sato-Tate distributions and Galois endomorphism modules in genus 2
- The p-rank of ramified covers of curves.
Cited in
(10)- Counting points on smooth plane quartics
- A point counting algorithm for cyclic covers of the projective line
- scientific article; zbMATH DE number 2081082 (Why is no real title available?)
- Computing \(L\)-polynomials of Picard curves from Cartier-Manin matrices
- Computational Number Theory, Past, Present, and Future
- Galois representations of superelliptic curves
- Sato-Tate groups of abelian threefolds
- Ceresa cycles of bielliptic Picard curves
- The \(\mathrm{a}\)-number for superelliptic curves of genus
- The exponential torsion of superelliptic Jacobians
This page was built for publication: Counting points on superelliptic curves in average polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853812)