Irreducibility of random polynomials: general measures

DOI10.1007/S00222-023-01193-6MaRDI QIDQ6113252zbMATH OpenOpenAlexFDO

Authors Lior Bary-Soroker, Dimitris Koukoulopoulos, Gady Kozma

Publication date 8 August 2023

Published in Inventiones Mathematicae (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Distribution of integers with specified multiplicative constraints (11N25) Polynomials (irreducibility, etc.) (11R09) Arithmetic theory of polynomial rings over finite fields (11T55) Polynomials in general fields (irreducibility, etc.) (12E05) Symmetric groups (20B30)

Abstract: Let $mu$ be a probability measure on $mathbbZ$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)inmathbbZ[x]$ of degree $n$ are chosen independently at random according to $mu$ while ensuring that $f(0)eq0$, then there is a positive constant $heta=heta(mu)$ such that $f(x)$ has no divisors of degree $lehetan$ with probability that tends to 1 as $noinfty$. Furthermore, in certain cases, we show that a random polynomial $f(x)$ with $f(0)eq0$ is irreducible with probability tending to 1 as $noinfty$. In particular, this is the case if $mu$ is the uniform measure on a set of at least 35 consecutive integers, or on a subset of $[-H,H]capmathbbZ$ of cardinality $ge{H}^{4/5}(logH{)}^2$ with $H$ sufficiently large. In addition, in all of these settings, we show that the Galois group of $f(x)$ is either $mathcal{A}_n$ or $mathcal{S}_n$ with high probability. Finally, when $mu$ is the uniform measure on a finite arithmetic progression of at least two elements, we prove a random polynomial $f(x)$ as above is irreducible with probability $gedelta$ for some constant $delta=delta(mu)>0$. In fact, if the arithmetic progression has step 1, we prove the stronger result that the Galois group of $f(x)$ is $mathcal{A}_n$ or $mathcal{S}_n$ with probability $gedelta$.

Recommendations

• Irreducible polynomials of bounded height
• Irreducibility of random polynomials of large degree
• Irreducibility of random polynomials of bounded degree
• Probabilistic Galois theory in function fields
• Irreducibility of Random Polynomials

Cites work

• A Brun-Titschmarsh theorem for multiplicative functions.
• A proof of van der Waerden's conjecture on random Galois groups of polynomials
• Almost primes whose expansion in base \(r\) misses some digits
• An inequality about irreducible factors of integer polynomials
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Arithmetic properties of integers with missing digits: distribution in residue classes
• Bounding the coefficients of a divisor of a given polynomial
• Die Seltenheit der reduziblen Gleichungen und der Gleichungen mit Affekt
• Enumerative Galois theory for cubics and quartics
• Evaluation effective du nombre d'entiers n tels que φ(n) ≤ x
• Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
• scientific article; zbMATH DE number 1716471 (Why is no real title available?)
• scientific article; zbMATH DE number 3170408 (Why is no real title available?)
• scientific article; zbMATH DE number 3171472 (Why is no real title available?)
• scientific article; zbMATH DE number 3528170 (Why is no real title available?)
• scientific article; zbMATH DE number 1834397 (Why is no real title available?)
• Integers with a divisor in \((y,2y]\).
• Irreducibility of random polynomials of large degree
• Irreducible polynomials of bounded height
• Irreducible polynomials over a finite field with restricted coefficients
• Number fields
• On a question of Lehmer and the number of irreducible factors of a polynomial
• On arithmetic properties of integers with missing digits. I: Distribution in residue classes
• On Random Generation of the Symmetric Group
• On the distribution of Galois groups
• On the distribution of primes in short intervals
• On the number of irreducible polynomials with 0,1 coefficients
• Opera de cribro
• Permutations contained in transitive subgroups
• Permutations Fixing ak-set
• Primes and polynomials with restricted digits
• Primes with restricted digits
• Sieve methods for polynomial rings over finite fields
• The distribution of prime numbers
• Zero-density sets containing integers with at most two prime factors

Cited in

(17)

• The characteristic polynomial of a random matrix
• Irreducibility of random polynomials of large degree
• Irreducibility of Random Polynomials
• scientific article; zbMATH DE number 7663177 (Why is no real title available?)
• Galois groups of random additive polynomials
• Probabilistic Galois theory in function fields
• Probabilistic Galois theory: the square discriminant case
• Topology of zero sets of polynomials with square discriminant
• Irreducibility of Littlewood polynomials of special degrees
• Irreducibility of the characteristic polynomials of random tridiagonal matrices
• Irreducibility of random polynomials of \(\mathbb{Z}[X]\)
• Irreducibility of polynomials with square coefficients over finite fields
• Full Galois groups of polynomials with slowly growing coefficients
• Galois groups of random polynomials over the rational function field
• Galois groups of reciprocal polynomials and the van der Waerden-Bhargava theorem
• A random polynomial with multiplicative coefficients is almost surely irreducible
• The asymptotic Mahler measure of Gaussian periods

This page was built for publication: Irreducibility of random polynomials: general measures

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