Related papers: Counting points on curves using a map to P^1

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…

In 2003, Kedlaya gave an algorithm to compute the zeta function associated to a hyperelliptic curve over a finite field, by computing the rigid cohomology of the curve. Edixhoven remarked that it is actually possible to compute the…

Let $X$ be a smooth projective hypersurface over a finite field $k$ of characteristic $p$. We address the problem of practically computing the zeta function $Z(X,T)$ of $X$ (equivalently, the point counts $\#X(\mathbb{F}_q)$, where $q =…

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…

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…

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…

We develop algorithms to compute two versions of the motivic Hilbert zeta function for curve singularities: the classical version, applicable to singularities with a monomial valuation semigroup or to singular curves defined by…

We compute the equivariant zeta function for bundles over infinite graphs and for infinite covers. In particular, we give a ``transfer formula'' for the zeta function of infinite graph covers. Also, when the infinite cover is given as a…

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.…

We survey some recent applications of p-adic cohomology to machine computation of zeta functions of algebraic varieties over finite fields of small characteristic, and suggest some new avenues for further exploration.

In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.

We show that it is possible to approximate the zeta-function of a curve over a finite field by meromorphic functions which satisfy the same functional equation and moreover satisfy (respectively do not satisfy) the analogue of the Riemann…

We give an algorithm to determine factorization types of primes in the number fields generated by a single point of odd order on an elliptic curve. We apply this to compute coefficients of the Dedekind zeta function of the field.

Combining the idea of motivic zeta function, due to Kapranov, and Pellikaan's definition of a two- variable zeta function for curves over finite fields in the present note we introduce a motivic two- variable zeta function for curves over…

Using the cohomology theory of Dwork, as developed by Adolphson and Sperber, we exhibit a deterministic algorithm to compute the zeta function of a nondegenerate hypersurface defined over a finite field. This algorithm is particularly…

Partial zeta functions of algebraic varieties over finite fields generalize the classical zeta function by allowing each variable to be defined over a possibly different extension field of a fixed finite field. Due to this extra variation…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

We compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of…

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…

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…