Counting points on curves using a map to $\mathbf {P}^1$

DOI10.1090/mcom/2996zbMath1402.11096arXiv1402.6758OpenAlexW2964016140MaRDI QIDQ2792351

Jan Tuitman

Publication date: 9 March 2016

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.6758

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture) (14G10) Zeta and (L)-functions in characteristic (p) (11M38)

Related Items (14)

Counting points on curves using a map to \(\mathbf P^1\). II. ⋮ Explicit Vologodsky integration for hyperelliptic curves ⋮ Quadratic Chabauty for modular curves: algorithms and examples ⋮ Improved complexity bounds for counting points on hyperelliptic curves ⋮ Rational points on \(X_0^+(125)\) ⋮ On the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficients ⋮ Computing zeta functions of cyclic covers in large characteristic ⋮ Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology ⋮ Explicit Coleman integration for curves ⋮ 𝑝-adic point counting on singular superelliptic curves ⋮ Computing zeta functions of generic projective hypersurfaces in larger characteristic ⋮ Explicit Chabauty-Kim for the split Cartan modular curve of level 13 ⋮ Counting points on smooth plane quartics ⋮ Two Recent p-adic Approaches Towards the (Effective) Mordell Conjecture

Uses Software

• Magma

Cites Work

• Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
• Improvements to the deformation method for counting points on smooth projective hypersurfaces
• Fast arithmetic in unramified \(p\)-adic fields
• The Magma algebra system. I: The user language
• An algorithm for computing an integral basis in an algebraic function field
• Effective convergence bounds for Frobenius structures on connections
• Counting points on hyperelliptic curves in average polynomial time
• An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
• A Recursive Method for Computing Zeta Functions of Varieties
• Computing zeta functions of nondegenerate curves
• Multiplying matrices faster than coppersmith-winograd
• Kedlaya's Algorithm in Larger Characteristic
• The Newton polygon of plane curves with many rational points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting points on curves using a map to $\mathbf {P}^1$