Geometric methods for improving the upper bounds on the number of rational points on algebraic curves over finite fields

Simple item page
dc.creatorLauter, Kristin
dc.creatorSerre, Jean-Pierre
dc.date2001-04-25
dc.date.accessioned2026-07-07T04:41:27Z
dc.date.available2026-07-07T04:41:27Z
dc.descriptionCurrently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus is small compared to q, or from Oesterle's optimization of the explicit formulae method if the genus is large. This paper presents three methods for improving these bounds. The arguments used are the indecomposability of the theta divisor of a curve, Galois descent, and Honda-Tate theory. Examples of improvements on the bounds include lowering them for a wide range of small genus when q=2^3, 2^5, 2^{13}, 3^3, 3^5, 5^3, 5^7, and when q=2^{2s}, s>1. For large genera, isolated improvements are obtained for q=3,8,9.
dc.description16 pages including the appendix. Main paper by Kristin Lauter, appendix by Jean-Pierre Serre
dc.identifierhttps://arxiv.org/abs/math/0104247
dc.identifierhttp://arxiv.org/abs/math/0104247
dc.identifierJournal of Algebraic Geometry 10 (2001), 19-36
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61367
dc.subjectAlgebraic Geometry
dc.subjectNumber Theory
dc.subject14G45 (Primary); 11G10, 14K15, 11D45 (Secondary)
dc.titleGeometric methods for improving the upper bounds on the number of rational points on algebraic curves over finite fields
dc.typetext

Files

Collections

arXiv