Geometric Methods for Improving the Upper Bounds on the Number of Rational Points on Algebraic Curves over Finite Fields

By Kristin E. Lauter, Jean-Pierre Serre. 2001

76 citations recorded by the source corpus.

Currently, 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 Fq 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.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/9f11c14fb949389dc1e59b34a7a69dfab3de2f6c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Jean-Pierre Serre
  2. Kristin E. Lauter
  3. Miran Kim
  4. Michael Naehrig
  5. Shai Halevi
  6. Frederik Vercauteren

In Computational Theory and Mathematics

  1. Jean-Pierre Serre
  2. Kristin E. Lauter
  3. Carel Faber
  4. Miran Kim
  5. Michael Naehrig
  6. Shai Halevi
  7. Frederik Vercauteren

In Information Systems

  1. Jean-Pierre Serre
  2. Kristin E. Lauter

Citations in the corpus