Averages of the number of points on elliptic curves
Abstract
If E is an elliptic curve defined over Q and p is a prime of good reduction for E, let E( Fp) denote the set of points on the reduced curve modulo p. Define an arithmetic function ME(N) by setting ME(N):= \#\p: \#E( Fp)= N\. Recently, David and the third author studied the average of ME(N) over certain "boxes" of elliptic curves E. Assuming a plausible conjecture about primes in short intervals, they showed the following: for odd N, the average of ME(N) over a box with sufficiently large sides is K(N)N for an explicitly-given function K(N). The function K(N) is somewhat peculiar: defined as a product over the primes dividing N, it resembles a multiplicative function at first glance. But further inspection reveals that it is not, and so one cannot directly investigate its properties by the usual tools of multiplicative number theory. In this paper, we overcome these difficulties and prove a number of statistical results about K(N). For example, we determine the mean value of K(N) over all N, odd N and prime N, and we show that K(N) has a distribution function. We also explain how our results relate to existing theorems and conjectures on the multiplicative properties of \# E( Fp), such as Koblitz's conjecture.
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.