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 zetaXp(s) be the local factor of its zeta function. We present an algorithm that computes zetaXp(s) for a single prime p in time p(1/2+o(1)), and another algorithm that computes zetaXp(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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…