A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä

On Totally Split Primes in High-Degree Torsion Fields of Elliptic Curves




TekijätMerikoski Jori

KustantajaOXFORD UNIV PRESS

Julkaisuvuosi2022

JournalInternational Mathematics Research Notices

Tietokannassa oleva lehden nimiINTERNATIONAL MATHEMATICS RESEARCH NOTICES

Lehden akronyymiINT MATH RES NOTICES

Artikkelin numero rnab263

Sivujen määrä38

ISSN1073-7928

eISSN1687-0247

DOIhttps://doi.org/10.1093/imrn/rnab263

Verkko-osoitehttps://academic.oup.com/imrn/advance-article/doi/10.1093/imrn/rnab263/6374698


Tiivistelmä
Analogously to primes in arithmetic progressions to large moduli, we can study primes that are totally split in extensions of Q of high degree. Motivated by a question of Kowalski we focus on the extensions Q(E[d]) obtained by adjoining the coordinates of d-torsion points of a non-CM elliptic curve E/Q. We show that for almost all integers d there exists a non-CM elliptic curve E/Q and a prime p < vertical bar Gal(Q(E[d])/Q)vertical bar = d(4-0) (1) , which is totally split in Q(E[d]). Note that such a prime p is not accounted for by the expected main term in the Chebotarev Density Theorem. Furthermore, we prove that for almost all d that factorize suitably there exists a non-CM elliptic curve E/Q and a prime p with p(0.2694) < d, which is totally split in Q(E[d]). To show this we use work of Kowalski to relate the question to the distribution of primes in certain residue classes modulo d(2) . Hence, the barrier p < d (4) is related to the limit in the classical Bombieri-Vinogradov Theorem. To break past this we make use of the assumption that d factorizes conveniently, similarly as in the works on primes in arithmetic progression to large moduli by Bombieri, Friedlander, Fouvry, and Iwaniec, and in the more recent works of Zhang, Polymath, and the author. In contrast to these works we do not require any of the deep exponential sum bounds (i.e., sums of Kloosterman sums or Weil/Deligne bound). Instead, we only require the classical large sieve for multiplicative characters and we apply Harman's sieve method to obtain a combinatorial decomposition for primes.



Last updated on 2024-26-11 at 23:11