No matches. Try fewer words or reset the filters.
Foundations: polynomials, fields, and Galois groups
An introduction to irreducibility, algebraic extensions, and the action of the Galois group on roots, with examples and connections to arithmetic and geometry.
ArticleField extensions and minimal polynomials
Minimal polynomials define fields generated by roots. Extension degrees, embeddings, and separability explain how these fields fit together.
ArticleThe Galois correspondence and intermediate fields
Subgroups describe intermediate fields, changes of ground field, and blocks in the action on roots. Examples show how to use the correspondence in group calculations.
ArticleReduction modulo primes
Factoring modulo primes gives restrictions on the degrees of rational factors. Incompatible restrictions prove irreducibility.
ArticleSchönemann–Eisenstein and Dumas criteria
Divisibility and coefficient valuations prove irreducibility by the Schönemann–Eisenstein and Dumas criteria. Translation provides further applications.
ArticleNewton polygons and Galois groups
Coefficient valuations determine root valuations and restrict factor degrees. Suitable Newton slopes also imply containment of the alternating group.
ArticleRoot bounds and prime-value criteria
Perron’s criterion uses the size of coefficients to locate roots. Prime-value criteria combine integer evaluations with root bounds or digit conditions.
ArticleIrreducibility from integer values
Schur’s theorem and Pólya’s criterion prove irreducibility from small integer values. A separate criterion uses prime and unit values.
ArticleSparse polynomials and factor reversal
For polynomials with two widely separated blocks of coefficients, large-gap theorems prove irreducibility of the nonreciprocal part under explicit hypotheses.
ArticleCapelli’s theorem and polynomial composition
Capelli’s theorem tests a composition over the field generated by a root. Binomial criteria and norms give applications to powers and iterates.
ArticleFrobenius and factorization modulo primes
Factor degrees modulo a good prime give cycle lengths in the Galois group. Combining these cycles can determine the group.
ArticleDiscriminants, 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.
ArticleRamification 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.
ArticleTransitivity, primitivity, and cycle criteria
Primitivity and cycle structure give criteria for G ⊇ Aₙ and G = Sₙ.
ArticleResolvents and subgroup tests
Resolvents convert the Galois action on expressions in the roots into factorization tests for subgroups.
ArticleReciprocal polynomials
A reciprocal polynomial of degree reduces to a polynomial of degree in . Its roots then require quadratic extensions.
ArticleTrinomials
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.
ArticleHeight 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.
ArticleRandom 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.
ArticleLittlewood polynomials
Littlewood polynomials have coefficients ±1. Reduction modulo two gives deterministic criteria; Newton polygons prove high-probability irreducibility along special degrees.
ArticleFactor reversal for random binary polynomials
Reversing one factor preserves the reciprocal product. This identity underlies Kogler’s preprint on random binary polynomials.
ArticleCharacteristic polynomials of random matrices
Characteristic polynomials have dependent coefficients. Their irreducibility and Galois groups are studied through finite-field rank estimates.
ArticleRandom 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.
ArticleTwisted reciprocity and square discriminants
The pairing α ↦ b/α gives a trace polynomial. A discriminant identity then reduces the sign of the Galois action to a square-value condition.
ArticleSpecialization and Hilbert irreducibility
Hilbert irreducibility preserves the Galois group for many parameter values. Exceptional values are studied through resolvents, rational points, and local conditions.
ArticleExceptional specializations
Resolvent curves describe parameters where a Galois group decreases. Their rational points control the size and structure of the exceptional set.
ArticleCritical points and polynomial monodromy
In characteristic zero, simple critical points with distinct critical values force the generic Galois group to be symmetric.
ArticleBranched 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.
ArticleGeneric 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.
ArticleInverse Galois theory and generic polynomials
The inverse Galois problem asks which finite groups occur over a given field. Regular covers and generic polynomials give stronger forms of realization.
ArticleComposition and iteration
Composition gives towers of field extensions. Iteration leads to irreducibility questions at every depth and Galois actions on trees of preimages.
ArticlePolynomial decomposition
Ritt’s theorems describe factorizations under composition. Intermediate fields and blocks connect these decompositions with monodromy.
ArticleIrreducibility of iterates
Capelli’s lemma, norms, and valuations prove irreducibility at successive depths. Eventual stability asks for a bounded number of factors.
ArticleArboreal Galois groups
The Galois groups of iterated preimage equations act on rooted trees. Critical values can detect maximal groups and explain smaller ones.
ArticleGleason 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.
ArticleFinite fields and Frobenius
Every finite field has a unique extension of each degree, up to isomorphism. Frobenius determines conjugates, subfields, and factor degrees.
ArticleIrreducibility over finite fields
Frobenius gives an exact irreducibility test, a counting formula, and a method for constructing irreducible polynomials.
ArticleIrreducible 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.
ArticlePrimitive 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.
ArticleFactorization 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.
ArticleSparse irreducible polynomials over finite fields
Sparse irreducibles give efficient finite-field representations. Their existence depends on the support, while sparse factors of cyclotomic polynomials form a separate classification problem.
ArticlePolynomials in several variables
Irreducibility over a field, absolute irreducibility, and the geometry of polynomial equations.
ArticleNewton 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.
ArticlePolynomials with separated variables
Criteria for f(x)−g(y), sums in independent variables, and the Davenport–Lewis–Schinzel problem.
ArticlePolynomial fibers and Bertini’s theorem
Composition, exceptional reducible fibers, and the irreducibility of general sections.
ArticleFactorization in several variables
Coefficient equations, local factorization, differential methods, and algorithms that use sparse support.
ArticlePolynomial factorization algorithms
Algorithms over finite fields use Frobenius and linear algebra. Over the rationals, modular factorization, Hensel lifting and lattice reduction recover exact factors.
ArticleFactoring sparse polynomials
Sparse polynomials are encoded by their nonzero terms. Large exponents and dense factors make this a different algorithmic problem from dense factorization.
ArticleAlgorithms 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.