The Lang-Trotter Conjecture on Average
Stephan Baier

TL;DR
This paper studies the average behavior of the Lang-Trotter conjecture for elliptic curves, showing that the average count of primes with a given Frobenius trace aligns with predicted asymptotics under certain conditions.
Contribution
It proves an average result for the Lang-Trotter conjecture over families of elliptic curves, improving previous bounds and establishing an 'almost-all' result.
Findings
Average of $\pi_E^r(x)$ over certain elliptic curve families is asymptotic to $C_rrac{\sqrt{x}}{\log x}$
Conditions on $A, B$ ensure the result holds for a large set of curves
An 'almost-all' result on $\pi_E^r(x)$ is established
Abstract
For an elliptic curve over and an integer let be the number of primes of good reduction such that the trace of the Frobenius morphism of equals . We consider the quantity on average over certain sets of elliptic curves. More in particular, we establish the following: If and , then the arithmetic mean of over all elliptic curves : with , and is , where is some constant depending on . This improves a result of C. David and F. Pappalardi. Moreover, we establish an ``almost-all'' result on .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Limits and Structures in Graph Theory
