Related papers: Counting points on surfaces in polynomial time

In a recent paper Z\'u\~niga-Galindo and the author begun the study of the local zeta functions for Laurent polynomials. In this work we continue this study by giving a very explicit formula for the local zeta function associated to a…

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 propose a simple method for uniform sampling of points on the surface of a hypersphere in arbitrarily many dimensions. By avoiding the evaluation of computationally expensive functions like logarithms, sines, cosines, or higher order…

In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise…

We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…

We develop a method for mean-value estimation of long Dirichlet polynomials. For an application, we use our method to study properties of the logarithmic derivative of the Riemann zeta function.

We derive formulas for the number of points on the basic stratum of certain Kottwitz varieties in terms of automorphic representations and certain explicit polynomials, for which we present efficient algorithms for computation. We obtain…

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…

This article examines dynamical systems on a class of K3 surfaces in $\mathbb{P}^{2} \times \mathbb{P}^{2}$ with an infinite automorphism group. In particular, this article develops an algorithm to find $\mathbb{Q}$-rational periodic points…

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

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…

We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

In this work we provide an algorithm approximating the tangent bivector at a point of a smooth surface through inscribed triangles converging to the point, regardless their form or position with respect to the tangent plane. This result is…

We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the…

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…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

In a recent article we have discussed the connections between averages of powers of Riemann's $\zeta$-function on the critical line, and averages of characteristic polynomials of random matrices. The result for random matrices was shown to…

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…

Assume a polynomial-time algorithm for factoring integers, Conjecture~\ref{conj}, $d\geq 3,$ and $q$ and $p$ are prime numbers, where $p\leq q^A$ for some $A>0$. We develop a polynomial-time algorithm in $\log(q)$ that lifts every…