Search arXivSearch

arXiv · 2510.18857

Irreducibility and Galois groups of random reciprocal polynomials of large degree

Abstract

Let $A = a_0T^m + \sum_{j=1}^{m-1} a_j (T^{m-j}+T^{m+j}) + T^{2m}+1 \in \mathbf{Z}[T]$ be a monic reciprocal polynomial of degree $2m$ sampled randomly by selecting its coefficients $a_0,a_1,\dots,a_{m-1}$ independently according to a given probability measure $μ$ on $\mathbf{Z}$. For a wide range of measures $μ$, we prove that $A$ is irreducible with probability $\ge 1-Cm^{-c}$ for some absolute constants $c,C>0$. In addition, we prove that with the same probability the Galois group of $A$ is either the full hyperoctahedral group $\mathcal{C}_2 \wr \mathcal{S}_m$ or one of two of its index-$2$ subgroups. The main condition that $μ$ must satisfy is of Fourier-theoretic nature, and holds for example when $μ$ is the uniform measure on a set of at least $35$ consecutive integers, or on an arbitrary, sufficiently large subset of an interval $[-H,H]$, with $H$ larger than some absolute constant. Our most general result allows for each $a_j$ to be sampled by its own probability measure $μ_j$. Our approach builds on earlier work of Bary-Soroker, Kozma and the second author, who proved for essentially the same $μ_j$ that the 'standard' monic polynomial $a_0 + \cdots + a_{m-1}T^{m-1} + T^m$ is irreducible and has as Galois group either the symmetric group $\mathcal{S}_m$ or the alternating group $\mathcal{A}_m$ with high probability, conditioning on $a_0 \neq 0$. In our setting of reciprocal polynomials, we can rule out (all subgroups of) the maximal alternating subgroup $(\mathcal{C}_2 \wr \mathcal{S}_m) \cap \mathcal{A}_{2m}$ of the hyperoctahedral group as likely Galois group of $A$ by analyzing its discriminant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Hokken, Dimitris Koukoulopoulos. 2025-10-21. Irreducibility and Galois groups of random reciprocal polynomials of large degree. https://arxiv.org/abs/2510.18857

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT