An extension of Kedlaya's algorithm for hyperelliptic curves
From MaRDI portal
Publication:654037
DOI10.1016/J.JSC.2011.08.019zbMATH Open1234.14001arXiv1006.4206OpenAlexW2049709309MaRDI QIDQ654037FDOQ654037
Authors: Michael C. Harrison 
Publication date: 21 December 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Abstract: In this paper we describe a generalisation and adaptation of Kedlaya's algorithm for computing the zeta function of a hyperelliptic curve over a finite field of odd characteristic that the author used for the implementation of the algorithm in the Magma library. We generalise the algorithm to the case of an even degree model. We also analyse the adaptation of working with the rather than the differential basis. This basis has the computational advantage of always leading to an integral transformation matrix whereas the latter fails to in small genus cases. There are some theoretical subtleties that arise in the even degree case where the two differential bases actually lead to different redundant eigenvalues that must be discarded.
Full work available at URL: https://arxiv.org/abs/1006.4206
Recommendations
- Kedlaya's Algorithm in Larger Characteristic
- MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING
- Explicit \(p\)-adic method for elliptic and hyperelliptic curves
- 𝑝-adic point counting on singular superelliptic curves
- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
- An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
- Counting points on hyperelliptic curves in average polynomial time
- scientific article; zbMATH DE number 1942432
- Point counting on non-hyperelliptic genus 3 curves with automorphism group \(\mathbb Z/2\mathbb Z\) using Monsky-Washnitzer cohomology
- Computing zeta functions of nondegenerate curves
Elliptic curves (14H52) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Software, source code, etc. for problems pertaining to associative rings and algebras (16-04)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Formal cohomology. I
- Formal cohomology. II: The cohomology sequence of a pair
- Computing zeta functions of nondegenerate curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- A p-Adic Quasi-Quadratic Time Point Counting Algorithm
- An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
- Title not available (Why is that?)
- Algorithmic Number Theory
- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
- Formal cohomology. III: Fixed point theorems
- Canonical coordinates on the canonical lift
- Relative Rigid Cohomology and Deformation of Hypersurfaces
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- Point counting in families of hyperelliptic curves
Cited In (16)
- Counting points on hyperelliptic curves in average polynomial time
- Explicit Vologodsky integration for hyperelliptic curves
- MEMORY EFFICIENT HYPERELLIPTIC CURVE POINT COUNTING
- Report on the Denef-Vercauteren/Kedlaya algorithm
- Computing \(L\)-series of geometrically hyperelliptic curves of genus three
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication
- Title not available (Why is that?)
- Two Recent p-adic Approaches Towards the (Effective) Mordell Conjecture
- Computing zeta functions of cyclic covers in large characteristic
- Title not available (Why is that?)
- Counting points on hyperelliptic curves of genus 2 with real models
- Explicit Coleman integration in larger characteristic
- Effective termination of Kohn's algorithm for subelliptic multipliers
- Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology
- Coleman integration for even-degree models of hyperelliptic curves
- An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic \(2\)
Uses Software
This page was built for publication: An extension of Kedlaya's algorithm for hyperelliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654037)
