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, superelliptic and C_{ab} curves, can be transformed to fit the nondegenerate case. For curves with a fixed Newton polytope, the property of being nondegenerate is generic, so that the algorithm works for almost all curves with given Newton polytope. For a genus g curve over F_{p^n}, the expected running time is O(n^3g^6 + n^2g^{6.5}), whereas the space complexity amounts to O(n^3g^4), assuming p is fixed.
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 in $p$. These are illustrated with a number of examples including K3 surfaces, Calabi-Yau threefolds, and a cubic fourfold. The latter example is a non-special cubic fourfold appearing in the Ranestad-Voisin coplanar divisor on moduli space; this verifies that the coplanar divisor is not a Noether-Lefschetz divisor in the sense of Hassett.
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 well-suited to work with polynomials in small characteristic that have few monomials (relative to their dimension). Our method covers toric, affine, and projective hypersurfaces and also can be used to compute the L-function of an exponential sum.
The holomorphy conjecture states roughly that Igusa's zeta function associated to a hypersurface and a character is holomorphic on $\mathbb{C}$ whenever the order of the character does not divide the order of any eigenvalue of the local monodromy of the hypersurface. In this article we prove the holomorphy conjecture for surface singularities which are nondegenerate over $\mathbb{C}$ with respect to their Newton polyhedron. In order to provide relevant eigenvalues of monodromy, we first show a relation between the normalized volume (which appears in the formula of Varchenko for the zeta functi…
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 hypersurface, where $p$ is the characteristic of the finite field. In particular, this applies to the problem of counting rational points of an algebraic variety over a finite field.
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 space complexity to $\tilde{O}(\log(p))$ while remaining polynomial in the other input parameters.
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 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, and present some explicit examples which we have computed.
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 performance of our SageMath implementation on a range of examples. The algorithm relies on Gonçalves's generalization of Kedlaya's algorithm for cyclic covers, and Harvey's work on Kedlaya's algorithm for large characteristic.
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 formula for a class of $p$-adic integrals under non-degeneracy conditions with respect to associated Newton polytopes. Our techniques prove to be especially useful for the computation of topological zeta functions associated with algebras, resulting in the first systematic investigation of their properties.
Building on our previous work (arXiv:1405.5711), we develop the first practical algorithm for computing topological zeta functions of nilpotent groups, non-associative algebras, and modules. While we previously depended upon non-degeneracy assumptions, the theory developed here allows us to overcome these restrictions in various interesting cases.
Given a hypersurface, $X$, prime $p$, the zeta function is a generating function for the number of $\mathbb{F}_{p}$ rational points of $X$. Until now, there is no algorithm for computing hypersurfaces with ADE singularities. Scott Stetson and Vladimir Baranovsky provided an algorithm with Mathematica for the ordinary double point case. In this paper, I go over a Sage algorithm for computing the zeta function of a hypersurface with ADE singularities over 3-dimensional projective space. To make the algorithm more efficient, I established an equivalence between a polynomial belonging to the Jacob…
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 obtained by making corrections at singular points. We report on an implementation and provide some examples in MAGMA which demonstrate an improvement over Tuitman's algorithm.
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 zeta function. We present an algorithm that computes zeta_{X_p}(s) for a single prime p in time p^(1/2+o(1)), and another algorithm that computes zeta_{X_p}(s) for all primes p < N in time N (log N)^(3+o(1)). These generalise previous results of the author from hyperelliptic curves to completely arbitrary varieties.
We determine what isogeny classes of supersingular abelian surfaces over a finite field k of characteristic 2 contain jacobians. We deal with this problem in a direct way by computing explicitly the zeta function of all supersingular curves of genus 2. Our procedure is constructive, so that we are able to exhibit curves with prescribed zeta function and to count the number of curves, up to k-isomorphism, leading to the same zeta function.
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the \emph{Eisenstein cocycle} $Ψ$, a group cocycle for $GL_{n} (\Z )$; the special values are computed as periods of $Ψ$, and are expressed in terms of generalized Dedekind sums. We conclude with some numerical examples for cubic and quartic fields of small discriminant.
We describe a method to accelerate the numerical computation of the coefficients of the polynomials $P_k(x)$ that appear in the conjectured asymptotics of the $2k$-th moment of the Riemann zeta function. We carried out our method to compute the moment polynomials for $k \leq 13$, and used these to experimentally test conjectures for the moments up to height $10^8$.
In this paper we present a polynomial time algorithm to compute the local zeta function Z(s,f) attached to a polynomial f(x) in Z[x] (in one variable, with splitting field Q) and a prime p. The algorithm reduces in polynomial time the computation of Z(s,f) to the computation of a factorization of f(x) over Q. This reduction is accomplished by constructing a weighted tree from the p-adic expansion of the roots of f(x) modulo a certain power of p, and then associating a generating function to this tree. The generating function constructed in this way coincides with the local zeta function of f(x…
Assuming the Generalized Riemann Hypothesis, Bach has shown that one can calculate the residue of the Dedekind zeta function of a number field K by a clever use of the splitting of primes p < X, with an error asymptotically bounded by 8.33 log D_K/(\sqrt{X}\log X), where D_K is the absolute value of the discriminant of K. Guided by Weil's explicit formula and still assuming GRH, we make a different use of the splitting of primes and thereby improve Bach's constant to 2.33. This results in substantial speeding of one part of Buchmann's class group algorithm.
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the zeta function of a system of $m$ polynomial equations in $n$ variables over the finite field $\FF_q$ of $q$ elements, for $m$ large. The dependence on $m$ in the original algorithms was exponential in $m$. Our main result is a reduction of the exponential dependence on $m$ to a polynomial dependence on $m$. As an application, we speed up a doubly exponential time algorithm from a software verification paper \cite{BJK} (on universal equivalence of programs over finite fields) to singly exponenti…
An elementary method of computing the values at negative integers of the Riemann zeta function is presented. The principal ingredient is a new q-analogue of the Riemann zeta function. We show that for any argument other than 1 the classical limit of this q-analogue exists and equals the value of the Riemann zeta.
We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p for many small primes p, and then reconstruct B(k) via the Chinese Remainder Theorem. The asymptotic time complexity is O(k^2 log(k)^(2+epsilon)), matching that of existing algorithms that exploit the relationship between B(k) and the Riemann zeta function. Our implementation is significantly faster than several existing implementations of the zeta-function method.
Igusa's local zeta function $Z_{f,p}(s)$ is the generating function that counts the number of integral roots, $N_{k}(f)$, of $f(\mathbf x) \bmod p^k$, for all $k$. It is a famous result, in analytic number theory, that $Z_{f,p}$ is a rational function in $\mathbb{Q}(p^s)$. We give an elementary proof of this fact for a univariate polynomial $f$. Our proof is constructive as it gives a closed-form expression for the number of roots $N_{k}(f)$. Our proof, when combined with the recent root-counting algorithm of (Dwivedi, Mittal, Saxena, CCC, 2019), yields the first deterministic poly($|f|, \log …
Solutions of Calabi-Yau Differential Operators as Truncated p-adic Series and Efficient Computation of Zeta Functions
University of Sheffield（谢菲尔德大学）；PRISMA+ Cluster of Excellence & Mainz Institute for Theoretical Physics Johannes Gutenberg-Universität Mainz（PRISMA卓越集群与美因茨理论物理研究所 约翰内斯·古腾堡美因茨大学）；Okinawa Institute of Science and Technology（冲绳科学技术大学院大学）；Cornell University（康奈尔大学）
Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph properties which we can determine using the edge zeta function. In particular, the edge zeta function is enough to deduce the clique number, the number of Hamiltonian cycles, and whether a graph is perfect or chordal. Actually computing these properties takes exponential time. Finally, we present a new example illustrating that the Ihara zeta function canno…
Let X be a regular scheme, projective and flat over the integers. Let A be the constant in the conjectured functional equation for the zeta-function of X. We give a conjecture computing A in terms of Euler characteristics of derived exterior powers of the sheaf of Kahler differentials on X, and prove this conjecture when the dimension of X is 1 or 2. This conjecture essentially says that the formulas for the special values of the zeta-function of X given by the author in a previous preprint are compatible with the functional equation.
An elementary approach for computing the values at negative integers of the Riemann zeta function is presented. The approach is based on a new method for ordering the integers and a new method for summation of divergent series. We show that the values of the Riemann zeta function can be computed, without using the theory of analytic continuation and functions of complex variable.
The definition for the $p$-adic Hurwitz-type Euler zeta functions has been given by using the fermionic $p$-adic integral on $\mathbb Z_p$. By computing the values of this kind of $p$-adic zeta function at negative integers, we show that it interpolates the Euler polynomials $p$-adically. Many properties are provided for the $p$-adic Hurwitz-type Euler zeta functions, including the convergent Laurent series expansion, the distribution formula, the functional equation, the reflection formula, the derivative formula, the $p$-adic Raabe formula and so on. The definition for the $p$-adic Euler $L$…
Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta function in terms of them and count the number of orbits of the Galois action associated with each cyclotomic-like polynomial to obtain its further factorization. We also give a necessary and sufficient condition for such a polynomial to be irreducible and discuss its irreducibility from this point of view.
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 the order of the group of rational points on the Jacobian of a smooth geometrically connected projective curve over a finite field of small characteristic.
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 Frobenius on the first cohomology group of the curve by means of Serre duality. The cup product involved can be computed locally, after first computing local expansions of a globally defined lift of Frobenius. The resulting algorithm's complexity is softly cubic in the field degree, which is also the case with Kedlaya's algorithm in the hyperelliptic case.
We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph $G$ to evaluate to multiple zeta values. The criterion depends only on the topology of $G$, and can be checked algorithmically. As a corollary, we reprove the result, due to Bierenbaum and Weinzierl, that the massless 2-loop 2-point function is expressible in terms of multiple zeta values, and generalize this to the 3, 4, and 5-loop cases. We find that the coefficients in the Taylor expansion of planar graphs in this rang…
Suppose that $ω_1,\ldots,ω_N$ are positive real numbers and $x$ is a complex number with positive real part. The multiple Barnes-Euler zeta function $ζ_{E,N}(s,x;\barω)$ with parameter vector $\barω=(ω_1,\ldots,ω_N)$ is defined as a deformation of the Barnes multiple zeta function as follows $$ ζ_{E,N}(s,x;\barω)=\sum_{t_1=0}^\infty\cdots\sum_{t_N=0}^\infty \frac{(-1)^{t_1+\cdots+t_N}}{(x+ω_1t_1+\cdots+ω_Nt_N)^s}. $$ In this paper, based on the fermionic $p$-adic integral, we define the $p$-adic analogue of multiple Barnes-Euler zeta function $ζ_{E,N}(s,x;\barω)$ which we denote by $ζ_{p,E,N}(…
In his work studying the Zeta functions of families of hypersurfaces, Dwork came upon a one-parameter family of hypersurfaces (now known as \emph{the} Dwork family). These examples were not only useful to Dwork in his study of his deformation theory for computing Zeta functions of families, but they have also proven to be extremely useful to physicists working in mirror symmetry. A startling result is that these families are very closely linked to hypergeometric functions. This phenomenon was carefully studied by Dwork and Candelas, de la Ossa, and Rodríguez-Villegas in a few special cases. Dw…
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 curves of genus at most five over finite fields of odd characteristic, including an implementation in Magma. We then use such a lift as input to an algorithm due to the second author for computing zeta functions of curves over finite fields using $p$-adic cohomology.
We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications. First, we show how to express special values of partial zeta functions associated to totally real number fields in terms of these sums via the Eisenstein cocycle introduced by the second author. Hence we obtain a polynomial-time algorithm for computing these special values. Second, we show how to use our techniques to compute certain special values of the Witte…
We study the sequence of zeta functions $Z(C_p,T)$ of a generic Picard curve $C:y^3=f(x)$ defined over $\mathbb{Q}$ at primes $p$ of good reduction for $C$. We define a degree 9 polynomial $ψ_f\in \mathbb{Q}[x]$ such that the splitting field of $ψ_f(x^3/2)$ is the $2$-torsion field of the Jacobian of $C$. We prove that, for all but a density zero subset of primes, the zeta function $Z(C_p,T)$ is uniquely determined by the Cartier-Manin matrix $A_p$ of $C$ modulo $p$ and the splitting behavior modulo $p$ of $f$ and $ψ_f$; we also show that for primes $\equiv 1 \pmod{3}$ the matrix $A_p$ suffice…
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 computes the local zeta functions of C at all odd primes of good reduction up to a prescribed bound N. The algorithm relies on an adaptation of the "accumulating remainder tree" to matrices with entries in a quadratic field. We report on an implementation, and compare its performance to previous algorithms for the ordinary hyperelliptic case.
In previous work it was shown that if certain series based on sums over primes of non-principal Dirichlet characters have a conjectured random walk behavior, then the Euler product formula for its $L$-function is valid to the right of the critical line $\Re (s) > \tfrac{1}{2}$, and the Riemann Hypothesis for this class of $L$-functions follows. Building on this work, here we propose how to extend this line of reasoning to the Riemann zeta function and other principal Dirichlet $L$-functions. We apply these results to the study of the argument of the zeta function. In another application, we de…
We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients are prescribed, provided that $n$ is coprime to $p$. Each of these counts is $\frac{1}{n}(q^{n-l} + \mathcal{O}(q^{n/2}))$. The main idea behind the algorithm is to associate to an equivalent problem a set of Artin-Schreier curves defined over $\mathbb{F}_q$ whose number of $\mathbb{F}_{q^n}$-rational affine points must be combined. This is accomplished by c…
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 for computing the zeta function of the curve E_g by using Dwork deformation in rigid cohomology. The time complexity of the algorithm is O(n^(2.667)) and it needs O(n^(2.5)) bits of memory. A slight adaptation requires only O(n^2) space, but costs time O(n^3). An implementation of this last result turns out to be quite efficient for n big enough.
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 $\ell$-torsion by structured polynomial systems. Our main result improves on previously known complexity bounds by showing that there exists a constant $c>0$ such that, for any fixed $g$, this algorithm has expected time and space complexity $O((\log q)^{cg})$ as $q$ grows and the characteristic is large enough.
Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for $g_i\in\mathbb{Z}[x_i]$. We give the first algorithm, with complexity sub-linear in $p$, to count the number of roots of $f$ over $\mathbb{Z}$ mod $p^k$ for arbitrary $k$: Our Las Vegas randomized algorithm works in time $(dk\log p)^{O(1)}\sqrt{p}$, and admits a quantum version for smooth curves working in time $(d\log p)^{O(1)}k$. Save for some subtleties conce…
We consider computing the Riemann zeta function $ζ(s)$ and Dirichlet $L$-functions $L(s,χ)$ to $p$-bit accuracy for large $p$. Using the approximate functional equation together with asymptotically fast computation of the incomplete gamma function, we observe that $p^{3/2+o(1)}$ bit complexity can be achieved if $s$ is an algebraic number of fixed degree and with algebraic height bounded by $O(p)$. This is an improvement over the $p^{2+o(1)}$ complexity of previously published algorithms and yields, among other things, $p^{3/2+o(1)}$ complexity algorithms for Stieltjes constants and $n^{3/2+o(…
Consider a smooth projective curve $\overline{C}$ over a finite field $\mathbb{F}_q$, equipped with a simply branched morphism $\overline{C} \to \mathbb{P}^1$ of degree $d \leq 5$. Assume char$\, \mathbb{F}_q > 2$ if $d \leq 4$, and char$\, \mathbb{F}_q > 3$ if $d=5$. In this paper we describe how to efficiently compute a lift of $\overline{C}$ to characteristic zero, such that it can be fed as input to Tuitman's algorithm for computing the Hasse-Weil zeta function of $\overline{C} / \mathbb{F}_q$. Our method relies on the parametrizations of low rank rings due to Delone-Faddeev and Bhargava.
