arXiv · 1402.3439
Computing zeta functions of arithmetic schemes
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.
Explore related subjects
Keep this discovery
David Harvey. 2014-02-14. Computing zeta functions of arithmetic schemes. https://arxiv.org/abs/1402.3439
Cite the original work for its findings. Save a collection to share your selection of sources.