Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Patterns of primes in the Sato–Tate conjecture

Patterns of primes in the Sato–Tate conjecture

Thumbnail Image
Download
Name

40993_2019_184_ReferencePDF.pdf

Size

484.57 KB

Format

Adobe PDF

Checksum (MD5)

6e0be968a513ed43fc48b1c3529c02f2

Download all files submitted through automated deposit
art_3272231548778872414.zip (417.05 KB)
Author(s)
Gillman, Nate
•
Kural, Michael
•
Pascadi, Alexandru
•
Peng, Junyao
•
Sah, Ashwin
Date Issued
December 19, 2019
Publisher
Springer International Publishing
Citation
Research in Number Theory. 2019 Dec 19;6(1):9
Version
Author's final manuscript
Abstract
Abstract Fix a non-CM elliptic curve $$E/\mathbb {Q}$$E/Q, and let $$a_E(p) = p + 1 - \#E(\mathbb {F}_p)$$aE(p)=p+1-#E(Fp) denote the trace of Frobenius at p. The Sato–Tate conjecture gives the limiting distribution $$\mu _{ST}$$μST of $$a_E(p)/(2\sqrt{p})$$aE(p)/(2p) within $$[-1, 1]$$[-1,1]. We establish bounded gaps for primes in the context of this distribution. More precisely, given an interval $$I\subseteq [-1, 1]$$I⊆[-1,1], let $$p_{I,n}$$pI,n denote the nth prime such that $$a_E(p)/(2\sqrt{p})\in I$$aE(p)/(2p)∈I. We show $$\liminf _{n\rightarrow \infty }(p_{I,n+m}-p_{I,n}) < \infty $$lim infn→∞(pI,n+m-pI,n)<∞ for all $$m\ge 1$$m≥1 for “most” intervals, and in particular, for all I with $$\mu _{ST}(I)\ge 0.36$$μST(I)≥0.36. Furthermore, we prove a common generalization of our bounded gap result with the Green–Tao theorem. To obtain these results, we demonstrate a Bombieri–Vinogradov type theorem for Sato–Tate primes.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/131475
DOI of Published Version
https://doi.org/10.1007/s40993-019-0184-8
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.