Bounds for the Lang-Trotter conjectures
David Zywina

TL;DR
This paper improves upper bounds related to the Lang-Trotter conjectures for non-CM elliptic curves over the rationals by applying a refined Chebotarev density theorem under GRH.
Contribution
It introduces an enhanced method using a smoothed Chebotarev density theorem to tighten bounds on prime counts in the Lang-Trotter conjectures under GRH.
Findings
Improved upper bounds for prime counts in Lang-Trotter conjectures.
Application of a smoothed Chebotarev density theorem under GRH.
Enhanced understanding of Frobenius fields for non-CM elliptic curves.
Abstract
For a non-CM elliptic curve defined over the rationals, Lang and Trotter made very deep conjectures concerning the number of primes for which is a fixed integer (and for which the Frobenius field at is a fixed imaginary quadratic field). Under GRH, we use a smoothed version of the Chebotarev density theorem to improve the best known Lang-Trotter upper bounds of Murty, Murty and Saradha, and Cojocaru and David.
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 · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory
