Subject 04 / 12

Polynomial families

familyIntermediateQ

Trinomials

The polynomial xn−x−1x^n-x-1 is irreducible over Q\mathbb Q with group SnS_n for every n≥2n\ge2. Its ramification gives a proof valid in every degree.

Article
familyIntermediateQ

Taylor polynomials

Schur’s theorem determines the groups of exponential truncations. Geometric truncations provide a contrasting family with an explicit cyclotomic factorization.

Article
researchResearchQ and number fields

Taylor 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.

Article
familyIntermediateQ

Generalized 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.

Article
familyIntermediateQ

Hermite, Bessel, and Legendre polynomials

Hermite, Bessel, and Legendre polynomials connect differential equations with polynomial arithmetic. Known irreducibility results use coefficient products, valuations, and symmetry.

Article
familyIntermediateQ

Krawtchouk polynomials

Krawtchouk polynomials have reflection symmetry. Centering gives a lower-degree polynomial whose Galois group is conjectured to be symmetric whenever it is irreducible.

Article
familyIntermediateQ

Kaneko–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.

Article
familyIntermediateQ

Eulerian polynomials

Eulerian polynomials count permutations by descents. Their reciprocal symmetry, shifted coefficients, and Newton polygons give irreducibility results and restrictions on the Galois group.

Article
familyIntermediateQ

Bernoulli 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.

Article
familyIntermediateQ

Fekete polynomials

Fekete polynomials have coefficients given by Dirichlet characters. Removing their known factors exposes reciprocal symmetry and leads to irreducibility and Galois-group conjectures.

Article
familyIntermediateQ

Truncated binomial polynomials

The truncations Pn,r(x)=∑j=0r(nj)xjP_{n,r}(x)=\sum_{j=0}^r\binom njx^j are conjectured to be irreducible for 1≤r≤n−21\le r\le n-2. Fixed-degree results and the sextic group problem are described below.

Article
familyIntermediateQ

Stern polynomials

Three polynomial sequences arise from Stern’s recurrence. Their definitions and irreducibility questions are different; each is specified below.

Article
familyIntermediateQ

Five-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.

Article
familyIntermediateQ

Touchard polynomials

Touchard polynomials count set partitions. Wilf’s conjecture concerns their rational roots; irreducibility of the remaining factor is a stronger question.

Article
familyIntermediateQ

Chromatic polynomials

Chromatic polynomials count graph colourings. After their integer roots are removed, the remaining factors lead to questions about algebraic integers and Galois groups.

Article
familyIntermediateCharacteristic zero; rational function fields

Tutte 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.

Article
familyResearchQ

Ehrhart polynomials

Ehrhart polynomials count lattice points in dilated polytopes. Their factors and Galois groups connect polyhedral geometry with arithmetic.

Article
familyAdvancedQ

Zero 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.

Article

References

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.