Related papers: Computing zeta functions of arithmetic schemes

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 consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…

The double sum sum_(s >= 1) sum_p 1/(p^s log p^s) = 2.00666645... over the inverse of the product of prime powers p^s and their logarithms, is computed to 24 decimal digits. The sum covers all primes p and all integer exponents s>=1. The…

We consider computing the Riemann zeta function $\zeta(s)$ and Dirichlet $L$-functions $L(s,\chi)$ to $p$-bit accuracy for large $p$. Using the approximate functional equation together with asymptotically fast computation of the incomplete…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…

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…

A Hermite type formula is introduced and used to study the zeta function over the real and complex n-projective space. This approach allows to compute the residua at the poles and the value at the origin as well as the value of the…

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 compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of…

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…

In this paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…

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…

I give a formula for the zeta function of a projective toric hypersurface over a finite field and estimate its Newton polygon. As an application this formula allows us to compute the exact number of rational points on the families of…

Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…

We define a zeta function of a graph by using the time evolution matrix of a general coined quantum walk on it, and give a determinant expression for the zeta function of a finite graph. Furthermore, we present a determinant expression for…

We compute the equivariant zeta function for bundles over infinite graphs and for infinite covers. In particular, we give a ``transfer formula'' for the zeta function of infinite graph covers. Also, when the infinite cover is given as a…

We investigate Solomon's zeta function for orders in the special case of orders generated by the standard basis of an integral table algebra, a special case of which is the integral adjacency algebra of an association scheme. As Solomon's…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

Let $O$ be a one-dimensional Cohen-Macaulay local ring having a finite field as a coefficient field. The aim of this work is to extend the explicit computations of the St\"ohr Zeta Function of $O$ for one and two branches to an arbitrary…

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…