Related papers: Improvements to the deformation method for countin…
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…
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…
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 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 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…
The purpose of this article is to give an explicit description, in terms of hypergeometric functions over finite fields, of zeta function of a certain type of smooth hypersurfaces that generalizes Dwork family. The point here is that we…
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…
Motivated by applications in point counting algorithms using p-adic cohomology, we give an explicit description of integral lattices in rigid cohomology spaces that p-adically approximate logarithmic crystalline cohomology modules. These…
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 present a randomised algorithm to compute the local zeta function of a fixed smooth, projective surface over $\mathbb{Q}$, at any large prime $p$ of good reduction. The runtime of our algorithm is polynomial in $\log p$, resolving a…
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,…
This paper intends to give a mathematical explanation for results on the zeta-function of some families of varieties recently obtained in the context of Mirror Symmetry. In doing so, we obtain concrete and explicit examples for some results…
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,…
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 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…
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…
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,…
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…
Motivated by an application to LDPC (low density parity check) algebraic geometry codes described by Voloch and Zarzar, we describe a computational procedure for establishing an upper bound on the arithmetic or geometric Picard number of a…
We express the number of points on the Dwork hypersurface $$X_{\lambda}^d: x_1^d+x_2^d+\cdots +x_d^d=d\lambda x_1x_2\cdots x_d$$ over a finite field of order $q \not \equiv 1 \pmod{d}$ in terms of McCarthy's $p$-adic hypergeometric function…