## Rigid cohomology and $$p$$-adic point counting.(English)Zbl 1087.14020

In this expository article the author considers the problem of computing the zeta function of an algebraic variety defined over a finite field. He discusses $$p$$-adic algorithms relying upon rigid cohomology in some incarnation. The emphasis is on curves.

### MSC:

 14G10 Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture) 11G25 Varieties over finite and local fields 14G15 Finite ground fields in algebraic geometry
Full Text:

### References:

 [1] P. Bachmann, Zur Theory von Jacobi’s Kettenbruch-Algorithmen. J. Reine Angew. Math. 75 (1873), 25-34. · JFM 04.0082.03 [2] E. Bombieri, On exponential sums in finite fields II. Invent. Math. 47 (1978), 29-39. · Zbl 0396.14001 [3] J-P. Dedieu, Newton’s method and some complexity aspects of the zero-finding problem. In “Foundations of Computational Mathematics”, (R.A. DeVore, A. Iserles, E. Suli), LMS Lecture Note Series 284, Cambridge University Press, 2001, 45-67. · Zbl 0978.65048 [4] B. Dwork, On the rationality of the zeta function of an algebraic variety. Amer. J. Math. 82 (1960), 631-648. · Zbl 0173.48501 [5] B. Dwork, On the zeta function of a hypersurface II. Ann. Math. (2) 80 (1964), 227-299. · Zbl 0173.48601 [6] N. Elkies, Elliptic and modular curves over finite fields and related computational issues. In “Computational perspectives in number theory: Proceedings of a conference in honour of A.O.L. Atkin” , (D.A. Buell and J.T. Teitelbaum), American Mathematical Society International Press 7 (1998), 21-76. · Zbl 0915.11036 [7] M.D. Huang, D. Ierardi, Counting points on curves over finite fields. J. Symbolic Comput. 25 (1998), 1-21. · Zbl 0919.11046 [8] K. Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology. Journal of the Ramanujan Mathematical Society 16 (2001), 323-338. · Zbl 1066.14024 [9] K. Kedlaya, Finiteness of rigid cohomology with coefficients, preprint 2002. · Zbl 1133.14019 [10] A.G.B Lauder, Deformation theory and the computation of zeta functions, Proceedings of the London Mathematical Society 88 (3) (2004), 565-602. · Zbl 1119.11053 [11] A.G.B. Lauder, Counting solutions to equations in many variables over finite fields, Foundations of Computational Mathematics 4 (3) (2004), 221-267. · Zbl 1076.11040 [12] A.G.B. Lauder, D. Wan, Counting points on varieties over finite fields of small characteristic. To appear in Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography (Mathematical Sciences Research Institute Publications), J.P. Buhler and P. Stevenhagen (eds), Cambridge University Press. Available at: [13] J. Pila, Frobenius maps of abelian varieties and finding roots of unity in finite fields. Math. Comp. 55 No. 192 (1990), 745-763. · Zbl 0724.11070 [14] R. Schoof, Elliptic curves over finite fields and the computation of square roots mod $$p$$. Math. Comp. 44 no. 170 (1985), 483-494. · Zbl 0579.14025 [15] N. Tsuzuki, Bessel F-isocrystals and an algorithm for computing Kloosterman sums, preprint 2003. [16] D. Wan, Algorithmic theory of zeta functions. To appear in Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography (Mathematical Sciences Research Institute Publications), J.P. Buhler and P. Stevenhagen (eds), Cambridge University Press. Available at:
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.