A bootstrap for the number of Fqr-rational points on a curve over Fq
Abstract
In this note we present a fast algorithm that finds for any r the number Nr of Fqr rational points on a smooth absolutely irreducible curve C defined over Fq assuming that we know N1,·s,Ng, where g is the genus of C. The proof of its validity is given in detail and its working are illustrated with several examples. In an Appendix we list the Python function in which we have implemented the algorithm together with other routines used in the examples.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.