A refined version of the Lang-Trotter Conjecture
Abstract
Let be an elliptic curve defined over the rational numbers and a fixed integer. Using a probabilistic model consistent with the Chebotarev theorem for the division fields of and the Sato-Tate distribution, Lang and Trotter conjectured an asymptotic formula for the number of primes up to which have Frobenius trace equal to , where is a {\it fixed} integer. However, as shown in this note, this asymptotic estimate cannot hold for {\it all} in the interval 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 in the interval , 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