arXiv Analytics

Sign in

arXiv:math/0602352 [math.NT]AbstractReferencesReviewsResources

A recursive method for computing zeta functions of varieties

Alan G. B. Lauder

Published 2006-02-16Version 1

We present a method for computing the zeta function of a smooth projective variety over a finite field which proceeds by induction on the dimension. We have implemented our approach for some surfaces using the Magma programming language, and present some explicit examples which we have computed.

Comments: 48 Pages
Journal: LMS J. Comp. Math. Vol.9, 2006, 222-269. www.lms.ac.uk/jcm/9/
Categories: math.NT, math.AG
Subjects: 11Y99, 11G25
Related articles: Most relevant | Search more
arXiv:math/9811191 [math.NT] (Published 1998-11-05)
Computing zeta functions over finite fields
arXiv:2007.13214 [math.NT] (Published 2020-07-26)
Computing zeta functions of large polynomial systems over finite fields
arXiv:math/0607308 [math.NT] (Published 2006-07-13, updated 2007-01-08)
Computing Zeta Functions of Nondegenerate Curves

Links

Toolbox