Chebotarev's theorem and Littlewood complexity

From MaRDI portal
Publication:2811188

DOI10.24033/ASENS.2291zbMATH Open1347.11079arXiv1308.1022OpenAlexW2603843297MaRDI QIDQ2811188FDOQ2811188

Joël Bellaïche

Publication date: 10 June 2016

Published in: Annales Scientifiques de l'École Normale Supérieure. Quatrième Série (Search for Journal in Brave)

Abstract: The effective version of Chebotarev's density theorem under the Generalized Riemann Hypothesis and the Artin conjecture (cf. Iwaniec and Kowalski's Analytic Number Theory, 5.13) involves a numerical invariant of a subset D of a finite group G that we call the Littlewood Complexity of D. We study this invariant in detail. Using this study, and a new application of the large sieve, we give improved versions of two standard questions related to Chebotarev: the bound on the first prime in a Frobenian set, and the asymptotic of the set of primes with given Frobenius in an infinite Galois extension. We then give concrete applications to various problems in number theory, such as the first primitive root modulo a prime ell, the factorization of an integral polynomial modulo primes, the Lang-Trotter conjecture and its generalizations, and Serre's uniformity conjecture.


Full work available at URL: https://arxiv.org/abs/1308.1022




Recommendations





Cited In (5)





This page was built for publication: Chebotarev's theorem and Littlewood complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811188)