Th\'eor\`eme de Chebotarev et complexit\'e de Littlewood

TL;DR

This paper refines the effective Chebotarev density theorem under GRH and Artin conjecture by analyzing Littlewood Complexity, leading to improved bounds and applications in prime distribution and number theory problems.

Contribution

It introduces a detailed study of Littlewood Complexity and applies a new large sieve technique to improve bounds related to Chebotarev's theorem and its number-theoretic applications.

Findings

Improved bounds on the first prime in Frobenian sets.

Asymptotic results for primes with specified Frobenius elements.

Concrete applications to primitive roots, polynomial factorizations, and conjectures in number theory.

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.