Trinomials
The polynomial is irreducible over with group for every . Its ramification gives a proof valid in every degree.
ArticleTaylor polynomials
Schur’s theorem determines the groups of exponential truncations. Geometric truncations provide a contrasting family with an explicit cyclotomic factorization.
ArticleTaylor polynomials and Katz–Rivin questions
Katz and Rivin ask about the frequency of symmetric, alternating, and other Galois groups among Taylor polynomials. Recent preprints give constructions and results for arithmetic coefficient families.
ArticleGeneralized Laguerre polynomials
Generalized Laguerre polynomials provide explicit applications of Newton polygons and discriminants. The principal results treat either a fixed parameter or a fixed degree.
ArticleHermite, Bessel, and Legendre polynomials
Hermite, Bessel, and Legendre polynomials connect differential equations with polynomial arithmetic. Known irreducibility results use coefficient products, valuations, and symmetry.
ArticleKrawtchouk polynomials
Krawtchouk polynomials have reflection symmetry. Centering gives a lower-degree polynomial whose Galois group is conjectured to be symmetric whenever it is irreducible.
ArticleKaneko–Zagier polynomials
Four Jacobi families give rational lifts of supersingular polynomials. Their irreducibility and symmetric-group conjecture has published partial results and a claimed proof in a 2026 preprint.
ArticleLaguerre polynomials with negative parameters
Hajir’s two-parameter Laguerre family includes exponential truncations and Bessel polynomials. Its conjectures ask for irreducibility and alternating-group containment.
ArticleEulerian polynomials
Eulerian polynomials count permutations by descents. Their reciprocal symmetry, shifted coefficients, and Newton polygons give irreducibility results and restrictions on the Galois group.
ArticleBernoulli and Euler polynomials
Bernoulli and Euler polynomials arise from sums of powers. Reflection, denominator formulas, and derivative identities control their factors, root multiplicities, and Galois actions.
ArticleFekete polynomials
Fekete polynomials have coefficients given by Dirichlet characters. Removing their known factors exposes reciprocal symmetry and leads to irreducibility and Galois-group conjectures.
ArticleTruncated binomial polynomials
The truncations are conjectured to be irreducible for . Fixed-degree results and the sextic group problem are described below.
ArticleStern polynomials
Three polynomial sequences arise from Stern’s recurrence. Their definitions and irreducibility questions are different; each is specified below.
ArticleFive-term Newman polynomials
Mercer conjectures that every reducible polynomial with constant term one and exactly five nonzero coefficients, all equal to one, has a cyclotomic factor.
ArticleTouchard polynomials
Touchard polynomials count set partitions. Wilf’s conjecture concerns their rational roots; irreducibility of the remaining factor is a stronger question.
ArticleChromatic polynomials
Chromatic polynomials count graph colourings. After their integer roots are removed, the remaining factors lead to questions about algebraic integers and Galois groups.
ArticleTutte polynomials
The Tutte polynomial of a connected matroid is irreducible. Viewed in one variable over a rational function field, it is conjectured to have full symmetric Galois group.
ArticleEhrhart polynomials
Ehrhart polynomials count lattice points in dilated polytopes. Their factors and Galois groups connect polyhedral geometry with arithmetic.
ArticleHecke polynomials and Maeda’s conjecture
The characteristic polynomials of Hecke operators record Fourier coefficients of modular eigenforms. Maeda’s conjecture predicts irreducibility and symmetric groups at level one.
ArticleZero polynomials of Eisenstein series
The non-elliptic zeros of an Eisenstein series determine a polynomial in the modular invariant. Irreducibility is known at infinitely many weights and conjectured in general.
ArticleReferences
- On the irreducibility of certain trinomialsSelmer, Ernst S. · 1956
Proves irreducibility of x^n-x-1 over Q for every n at least 2. The later full symmetric-group conclusion has a separate attribution.
- On the irreducibility of certain trinomials and quadrinomialsLjunggren, Wilhelm · 1960
Studies factorization of sparse polynomials through the distinction between reciprocal and nonreciprocal factors. Its factor-reversal method extends to later large-gap problems.
- Equations of the type X^n+aX+b with absolute Galois group S_nNart, Enric and Vila, Núria · 1979
An early source for symmetric Galois groups of trinomials; in particular, it precedes Osada for x^n-x-1. The institutional catalogue supplies an English title although the original paper is in Spanish.
- The Galois groups of the polynomials X^n+aX^l+bOsada, Hiroyuki · 1987
Gives arithmetic conditions forcing the full symmetric group for trinomials, using ramification to obtain transpositions. It includes an independent proof for x^n-x-1.
- Double transitivity of Galois groups of trinomialsCohen, Stephen D. and Movahhedi, A. and Salinier, Alain · 1997
Studies how arithmetic hypotheses on a trinomial force double transitivity. This is an intermediate group-theoretic step that can be combined with cycle or ramification information to obtain a large Galois group.
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.