On the congruence class modulo prime numbers of the number of rational points of a variety
Abstract
Let X be a scheme of finite type over Z. For p ∈ P the set of prime numbers, let NX(p) be the number of Fp-points of X/Fp. For fixed n≥ 1 and a1, …, an ∈ Z, we study the set i=1n p∈P-X, NX(p)≠ ai\ [\ p] where X is the finite set of primes of bad reduction for X. In case X≤ 3, we show the set is either empty or has positive lower-density. We also address the question of the size of the smallest prime in that set. Using sieve methods, we obtain for example an upper bound for the size of the least prime of p∈P, p NX(p) on average in particular families of hyperelliptic curves.
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.