Related papers: Counting points on curves using a map to P^1, II
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds,…
We present a new method for computing the zeta function of an algebraic curve over a finite field. The algorithm relies on a trace formula of Harvey to count points on a plane model of the curve. The zeta function of the curve is then…
We study the problem of lifting curves from finite fields to number fields in a genus and gonality preserving way. More precisely, we sketch how this can be done efficiently for curves of gonality at most four, with an in-depth treatment of…
We describe an algorithm to compute the zeta-function of a proper, smooth curve over a finite field, when the curve is given together with some auxiliary data. Our method is based on computing the matrix of the action of a semi-linear…
We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…
We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…
In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…
This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…
The purpose of this note is to give a brief overview on zeta functions of curve singularities and to provide some evidences on how these and global zeta functions associated to singular algebraic curves over perfect fields relate to each…
We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…
Curves over finite fields are of great importance in cryptography and coding theory. Through studying their zeta-functions, we would be able to find out vital arithmetic and geometric information about them and their Jacobians, including…
We present various improvements to the deformation method for computing the zeta function of smooth projective hypersurfaces over finite fields using $p$-adic cohomology. This includes new bounds for the $p$-adic and $t$-adic precisions…
We describe an algorithm to compute the zeta function of a cyclic cover of the projective line over a finite field of characteristic $p$ that runs in time $p^{1/2 + o(1)}$. We confirm its practicality and effectiveness by reporting on the…
We determine the zeta functions of trinomial curves in terms of Gauss sums and Jacobi sums, and we obtain an explicit formula of the genus of a trinomial curve over a finite field, then we study the conditions for a trinomial curve to be a…
We present a method for computing the zeta function of a smooth projective variety over a finite field which proceeds by induction on the dimension. We have implemented our approach for some surfaces using the Magma programming language,…
We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…
We present highlights of computations of the Riemann zeta function around large values and high zeros. The main new ingredient in these computations is an implementation of the second author's fast algorithm for numerically evaluating…
To count bundles on curves, we study zetas of elliptic curves and their zeros. There are two types, i.e., the pure non-abelian zetas defined using moduli spaces of semi-stable bundles, and the group zetas defined for special linear groups.…
In this paper we present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite field using Monsky-Washnitzer cohomology. The paper vastly generalizes previous work since all known cases, e.g. hyperelliptic,…