A Recursive Method for Computing Zeta Functions of Varieties

  • Lauder A
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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 held, 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.

Cite

CITATION STYLE

APA

Lauder, A. G. B. (2006). A Recursive Method for Computing Zeta Functions of Varieties. LMS Journal of Computation and Mathematics, 9, 222–269. https://doi.org/10.1112/s1461157000001261

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free