Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Linnik’s theorem for Sato-Tate laws on elliptic curves with complex multiplication

Linnik’s theorem for Sato-Tate laws on elliptic curves with complex multiplication

Thumbnail Image
Download
Name

40993_2015_Article_28.pdf

Size

467.81 KB

Format

Adobe PDF

Checksum (MD5)

f9d66488da7dc0390d584b222be09b41

Download all files submitted through automated deposit
art_6042044371255706397.zip (376.96 KB)
Author(s)
Park, Peter S.
•
Swaminathan, Ashvin A.
•
Chen, Evan
Date Issued
December 2015
Journal
Research in Number Theory
Publisher
Springer International Publishing
Citation
Chen, Evan, Peter S. Park, and Ashvin A. Swaminathan. “Linnik's Theorem for Sato-Tate Laws on Elliptic Curves with Complex Multiplication.” Research in Number Theory 1.1 (2015): n. pag.
Version
Final published version
Abstract
Let E/ℚ be an elliptic curve with complex multiplication (CM), and for each prime p of good reduction, let a[subscript E](p) = p + 1 − #E(𝔽[subscript p]) denote the trace of Frobenius. By the Hasse bound, a[subscript E] (p) = 2 √pcosθ[subscript p] for a unique θ[subscript p] ∈ [0,π]. In this paper, we prove that the least prime p such that θ[subscript p]∈ [α,β]⊂ [0,π] satisfies p ≪ (N[subscript E]/β − α)[superscript A], where N[subscript E] is the conductor of E and the implied constant and exponent A>2 are absolute and effectively computable. Our result is an analogue for CM elliptic curves of Linnik’s Theorem for arithmetic progressions, which states that the least prime p≡a (mod q) for (a,q)=1 satisfies p≪q[superscript L] for an absolute constant L>0.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution
http://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/109820
DOI of Published Version
https://doi.org/10.1007/s40993-015-0028-0
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.