Irreducibility and Galois groups of random reciprocal polynomials of large degree

Abstract

Let A = a0Tm + Σj=1m-1 aj (Tm-j+Tm+j) + T2m+1 ∈ Z[T] be a monic reciprocal polynomial of degree 2m sampled randomly by selecting its coefficients a0,a1,…,am-1 independently according to a given probability measure μ on Z. For a wide range of measures μ, we prove that A is irreducible with probability 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 C2 Sm 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 aj 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 a0 + ·s + am-1Tm-1 + Tm is irreducible and has as Galois group either the symmetric group Sm or the alternating group Am with high probability, conditioning on a0 ≠ 0. In our setting of reciprocal polynomials, we can rule out (all subgroups of) the maximal alternating subgroup (C2 Sm) A2m of the hyperoctahedral group as likely Galois group of A by analyzing its discriminant.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…