The LMS JCM, (9) 222-269. Published 04 Sep 2006. First received 17 Feb 2006.


A recursive method for computing zeta functions of varieties

Alan G. B. Lauder



Abstract: We present an algorithm that reduces the problem of calculating a numerical approximation to the action of absolute Frobenius on the middle-dimensional rigid cohomology of a smooth projective variety over a finite field, to that of performing the same calculation for a smooth hyperplane section. When combined with standard geometric techniques, this yields a method for computing zeta functions which proceeds 'by induction on the dimension'. The 'inductive step' combines previous work of the author on the deformation of Frobenius with a higher rank generalisation of Kedlaya's algorithm. The analysis of the loss of precision during the algorithm uses a deep theorem of Christol and Dwork on p-adic solutions to differential systems at regular singular points. We apply our algorithm to compute the zeta functions of compactifications of certain surfaces which are double covers of the affine plane.

This paper is available as PDF (480 KB).

All papers published in the LMS JCM are covered by a copyright agreement with the authors. Access to the papers is bound by this agreement; click here for details.

"A recursive method for computing zeta functions of varieties" has been subsequently referenced by the following articles :

  • Point counting in families of hyperelliptic curves in characteristic 2 (11 Jun 2007)
  • Ranks of elliptic curves over function fields (30 Jul 2008)
  • Go to the Volume 9 index
    Return to the LMS JCM Homepage