Related papers: Computing Zeta Functions of Nondegenerate Curves

We describe an algorithm to compute the zeta function of any non-hyperelliptic genus 3 plane curve $C$ over a finite field with automorphism group $G = \mathbb{Z} / 2 \mathbb{Z}$. This algorithm computes in the Monsky-Washnitzer cohomology…

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…

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 describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…

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…

This paper is dedicated to the description of the poles of the Igusa local zeta functions $Z(s,f,v)$ when $f(x,y)$ satisfies a new non degeneracy condition, that we have called arithmetic non degeneracy. More precisely, we attach to each…

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…

The local topological zeta function is a rational function associated to a germ of a complex holomorphic function. This function can be computed from an embedded resolution of singularities of the germ. For nondegenerate functions it is…

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 give an interim report on some improvements and generalizations of the Abbott-Kedlaya-Roe method to compute the zeta function of a nondegenerate ample hypersurface in a projectively normal toric variety over $\mathbb{F}_p$ in linear time…

We give improvements of the deformation method for computing the zeta function of a generic projective hypersurface in characteristic~$p$ that either reduce the dependence on~$p$ of the time complexity to $\tilde{O}(p^{1/2})$ or that of the…

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

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

Using toric modifications and some compatibility we compute the local $p$-adic zeta function of a plane curve singularity. Thanks to the compatibility, we can work over the analytic change of variables formula for $p$-adic integrals, hence…

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…

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 probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the…

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…

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