Related papers: Computing Zeta Functions of Nondegenerate Curves

In recent algorithms that use deformation in order to compute the number of points on varieties over a finite field, certain differential equations of matrices over p-adic fields emerge. We present a novel strategy to solve this kind of…

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 develop techniques for computing zeta functions associated with nilpotent groups, not necessarily associative algebras, and modules, as well as Igusa-type zeta functions. At the heart of our method lies an explicit convex-geometric…

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.

We present a probabilistic Las Vegas algorithm for computing the local zeta function of a genus-$g$ hyperelliptic curve defined over $\mathbb F_q$ with explicit real multiplication (RM) by an order $\Z[\eta]$ in a degree-$g$ totally real…

In this paper, we introduce (local and) global non-abelian zeta functions for general curves. As an example, we compute the so-called rank two zeta functions for genus two curves by studying non-abelian Brill-Noether loci and their…

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…

Let E_G be a family of hyperelliptic curves over F2^(alg cl) with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm to compute the zeta function of E_g for g in a degree n extension field…

For each $(m+1)$-tuple ${\bf n}_m=(n_0,n_1,\ldots,n_m)$ of positive integers, the ${\bf n}_m$-derived zeta function $\widehat\zeta_{X,\mathbb F_q}^{\,({\bf n}_m)}(s)$ is defined for a curve $X$ over $\mathbb F_q$. This derived zeta function…

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 give an explicit formula for the motivic zeta function in terms of a log smooth model. It generalizes the classical formulas for snc-models, but it gives rise to much fewer candidate poles, in general. As an illustration, we explain how…

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…

Let $f(\mathbf z)$ be an analytic function defined in the neighborhood of the origin of $\mathbb C^n$ which have some Newton degenerate faces. We generalize the Varchenko formula for the zeta function of the Milnor fibration of a Newton…

The zeta function of a curve $C$ over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix $\Theta_C$. We develop and present a new technique to compute the expected value of…

We describe a more efficient algorithm to compute p-adic Coleman integrals on odd degree hyperelliptic curves for large primes p. The improvements come from using fast linear recurrence techniques when reducing differentials in…

The zeta function of a curve over a finite field may be expressed in terms of the characteristic polynomial of a unitary symplectic matrix, called the Frobenius class of the curve. We compute the expected value of the trace of the n-th…

The Zeta function of a curve $C$ over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix $\Theta_C$. Following the work of Rudnick, we compute the expected value of $\mbox{tr}(\Theta_C^n)$ over the…

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…

In this article, we introduce a notion of non-degeneracy, with respect to certain Newton polyhedra, for rational functions over non-Archimedean locals fields of arbitrary characteristic. We study the local zeta functions attached to…

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…