Computing zeta functions of arithmetic schemes
Number Theory
2015-09-04 v2
Abstract
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.
Cite
@article{arxiv.1402.3439,
title = {Computing zeta functions of arithmetic schemes},
author = {David Harvey},
journal= {arXiv preprint arXiv:1402.3439},
year = {2015}
}
Comments
23 pages, to appear in the Proceedings of the London Mathematical Society