arXiv · math/0602352
A recursive method for computing zeta functions of varieties
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.
Explore related subjects
Keep this discovery
Alan G. B. Lauder. 2006-02-16. A recursive method for computing zeta functions of varieties. https://arxiv.org/abs/math/0602352
Cite the original work for its findings. Save a collection to share your selection of sources.