English

A refined version of the Lang-Trotter Conjecture

Number Theory 2008-10-26 v3

Abstract

Let EE be an elliptic curve defined over the rational numbers and rr a fixed integer. Using a probabilistic model consistent with the Chebotarev theorem for the division fields of EE and the Sato-Tate distribution, Lang and Trotter conjectured an asymptotic formula for the number of primes up to xx which have Frobenius trace equal to rr, where rr is a {\it fixed} integer. However, as shown in this note, this asymptotic estimate cannot hold for {\it all} rr in the interval r2x|r|\le 2\sqrt{x} with a uniform bound for the error term, because an estimate of this kind would contradict the Chebotarev density theorem as well as the Sato-Tate conjecture. The purpose of this note is to refine the Lang-Trotter conjecture, by taking into account the "semicircular law", to an asymptotic formula that conjecturally holds for arbitrary integers rr in the interval r2x|r|\le 2\sqrt{x}, with a uniform error term. We demonstrate consistency of our refinement with the Chebotarev theorem for a fixed division field, and with the Sato-Tate conjecture. We also present numerical evidence for the refined conjecture.

Keywords

Cite

@article{arxiv.0801.3946,
  title  = {A refined version of the Lang-Trotter Conjecture},
  author = {Stephan Baier and Nathan Jones},
  journal= {arXiv preprint arXiv:0801.3946},
  year   = {2008}
}

Comments

10 pages, 3 figures

R2 v1 2026-06-21T10:06:30.796Z