A recursive method for computing zeta functions of varieties
Number Theory
2007-05-23 v1 Algebraic Geometry
Abstract
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.
Keywords
Cite
@article{arxiv.math/0602352,
title = {A recursive method for computing zeta functions of varieties},
author = {Alan G. B. Lauder},
journal= {arXiv preprint arXiv:math/0602352},
year = {2007}
}
Comments
48 Pages