Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds for the Lang-Trotter conjectures

Published 31 Aug 2015 in math.NT | (1508.07682v1)

Abstract: For a non-CM elliptic curve $E$ defined over the rationals, Lang and Trotter made very deep conjectures concerning the number of primes $p\leq x$ for which $a_p(E)$ is a fixed integer (and for which the Frobenius field at $p$ 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.