Search

methodStart hereQ

Reduction modulo primes

Factoring modulo primes gives restrictions on the degrees of rational factors. Incompatible restrictions prove irreducibility.

Article
methodIntermediateQ

Newton polygons and Galois groups

Coefficient valuations determine root valuations and restrict factor degrees. Suitable Newton slopes also imply containment of the alternating group.

Article
methodIntermediateFields of characteristic not 2; Q

Discriminants, parity, and ramification

The discriminant detects repeated roots. For a separable polynomial in characteristic different from two, its square class determines whether every Galois permutation is even.

Article
methodIntermediateQ and local fields

Ramification and inertia

Inertia describes the Galois action at ramified primes. An odd prime dividing a monic integer polynomial’s discriminant exactly once gives a transposition.

Article
methodIntermediateQ; fields of characteristic not 2 for quartics

Resolvents and subgroup tests

Resolvents convert the Galois action on expressions in the roots into factorization tests for subgroups.

Article
methodIntermediateCharacteristic different from 2

Reciprocal polynomials

A reciprocal polynomial of degree 2m2m reduces to a polynomial of degree mm in x+x−1x+x^{-1}. Its roots then require quadratic extensions.

Article
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
researchResearchQ

Height bounds for exceptional Galois groups

For fixed degree and growing coefficient height, almost all polynomials have the largest group permitted by the family. The exceptional counts differ for ordinary and reciprocal polynomials.

Article
researchResearchQ

Random polynomials: models and methods

Random-polynomial theorems depend on the coefficient law and on whether degree or height grows. Irreducibility, alternating-group containment and the full symmetric group require different estimates.

Article
familyResearchQ

Littlewood polynomials

Littlewood polynomials have coefficients ±1. Reduction modulo two gives deterministic criteria; Newton polygons prove high-probability irreducibility along special degrees.

Article
researchResearchQ

Random reciprocal polynomials of growing degree

Inverse pairs restrict the group of a reciprocal polynomial to a wreath product. A recent preprint claims irreducibility and three possible groups with high probability for uniform interval coefficients.

Article
methodIntermediatenumber fields

Specialization and Hilbert irreducibility

Hilbert irreducibility preserves the Galois group for many parameter values. Exceptional values are studied through resolvents, rational points, and local conditions.

Article
foundationAdvancedNumber fields and characteristic-zero function fields

Exceptional specializations

Resolvent curves describe parameters where a Galois group decreases. Their rational points control the size and structure of the exceptional set.

Article
foundationAdvancedNumber fields and characteristic-zero function fields

Branched covers and rigidity

Branch cycles describe covers over the complex numbers. Rationality and rigidity can descend a cover to the rationals and produce a regular Galois realization.

Article
foundationAdvancedNumber fields and characteristic-zero function fields

Generic polynomials and invariant fields

A generic polynomial describes every extension with a given group over every extension of the base field. Invariant theory constructs some examples and explains important obstructions.

Article
methodIntermediategeneral fields and number fields

Composition and iteration

Composition gives towers of field extensions. Iteration leads to irreducibility questions at every depth and Galois actions on trees of preimages.

Article
methodIntermediateC; characteristic-zero function fields; tame and wild algorithms

Polynomial decomposition

Ritt’s theorems describe factorizations under composition. Intermediate fields and blocks connect these decompositions with monodromy.

Article
methodIntermediateGeneral fields; quadratic criteria in characteristic ≠2; Q

Irreducibility of iterates

Capelli’s lemma, norms, and valuations prove irreducibility at successive depths. Eventual stability asks for a bounded number of factors.

Article
methodIntermediateGeneral preimage trees; quadratic square-class criterion over Q

Arboreal Galois groups

The Galois groups of iterated preimage equations act on rooted trees. Critical values can detect maximal groups and explain smaller ones.

Article
familyIntermediateQ and cyclotomic fields

Gleason and Misiurewicz polynomials

Gleason and Misiurewicz polynomials record periodic and strictly preperiodic critical points. Their irreducibility asks whether the corresponding parameters form one Galois orbit.

Article
methodStart hereFinite fields

Finite fields and Frobenius

Every finite field has a unique extension of each degree, up to isomorphism. Frobenius determines conjugates, subfields, and factor degrees.

Article
methodIntermediatefinite fields

Irreducible polynomials with coefficient restrictions

Prescribed coefficients and allowed coefficient sets lead to different existence and counting problems. Trace and norm explain the first and constant coefficients; character sums and sieves treat more general restrictions.

Article
methodIntermediateFinite fields

Primitive and normal elements

A primitive element generates the multiplicative group. The conjugates of a normal element form a basis. Every finite-field extension contains an element with both properties.

Article
methodIntermediateFinite fields

Factorization statistics over finite fields

Factor degrees follow permutation cycle statistics in several large-field limits. Exact counting explains the unrestricted case; monodromy and point counting handle suitable families.

Article
methodIntermediatearbitrary fields

Newton polytopes and irreducibility

Factorization gives a Minkowski decomposition of the exponent polytope. A positive-dimensional, integrally indecomposable polytope proves absolute irreducibility when monomial factors are excluded.

Article
methodIntermediatearbitrary fields for coprime degrees; characteristic zero for the classification

Polynomials with separated variables

Criteria for f(x)−g(y), sums in independent variables, and the Davenport–Lewis–Schinzel problem.

Article
algorithmIntermediateFinite fields, Q, and p-adic fields

Polynomial factorization algorithms

Algorithms over finite fields use Frobenius and linear algebra. Over the rationals, modular factorization, Hensel lifting and lattice reduction recover exact factors.

Article
methodResearchnumber fields and general coefficient fields

Factoring sparse polynomials

Sparse polynomials are encoded by their nonzero terms. Large exponents and dense factors make this a different algorithmic problem from dense factorization.

Article
algorithmIntermediateQ, number fields, and p-adic fields

Algorithms for Galois groups

Galois-group algorithms combine local factorizations, permutation groups and resolvents. Certification proves that the resulting subgroup is the full group.

Article

Comments

Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.