Explore diagrams connecting objects, methods, and theorems →
Foundations
- Foundations: polynomials, fields, and Galois groups
Irreducibility, fields generated by roots, and Galois actions.
- Field extensions and minimal polynomials
Minimal polynomials, the tower law, embeddings, and separability.
- The Galois correspondence and intermediate fields
Intermediate fields, stabilizers, composita, and changes of ground field.
References
Irreducibility and the Galois group
- Reduction modulo primes
Reduction modulo primes and intersections of possible factor degrees.
- Frobenius and factorization modulo primes
Factor degrees as cycle lengths in the Galois group.
- Transitivity, primitivity, and cycle criteria
Blocks, primitivity, transpositions, and prime cycles.
- Discriminants, parity, and ramification
Repeated roots and the sign character of the root action.
Valuations and Galois groups
- Schönemann–Eisenstein and Dumas criteria
Coefficient divisibility and single-edge Newton polygons.
- Newton polygons and Galois groups
Root valuations, local factor degrees, and inertia.
- Transitivity, primitivity, and cycle criteria
Blocks, primitivity, transpositions, and prime cycles.
- Taylor polynomials
Exponential and geometric truncations; recent claims for shifted exponentials.
- Generalized Laguerre polynomials
Coefficient products and the distinction between fixed degree and fixed parameter.
Irreducibility and Galois groups in families
- Reciprocal polynomials
The trace polynomial and the quadratic extensions above its roots.
- Sparse polynomials and factor reversal
Cyclotomic factors, reciprocal factors, and large exponent gaps.
- Trinomials
The family and its group .
- Eulerian polynomials
Descent statistics, reciprocal symmetry, and prime-index irreducibility.
- Fekete polynomials
Character coefficients, forced factors, and inverse root pairs.
- Hermite, Bessel, and Legendre polynomials
Hermite, Bessel, and Legendre polynomials, with their precise normalizations.
- Ehrhart polynomials
Lattice-point counting and polynomial factorization.
Taylor polynomials and Katz–Rivin questions
- Taylor polynomials
Exponential and geometric truncations; recent claims for shifted exponentials.
- Taylor polynomials and Katz–Rivin questions
Katz–Rivin questions and preprint claims for prescriptions, binomial sections, and Catalan sections.
- Specialization and Hilbert irreducibility
Irreducibility and Galois groups under rational specialization.
- Newton polygons and Galois groups
Root valuations, local factor degrees, and inertia.
References
- Speculations in Galois Theory
- Galois groups of Taylor polynomials: prescriptions and arithmetic families
- Prime Witnesses and Eventual Alternating–Symmetric Galois Groups in a Jacobi Family
- Irreducibility of truncations of the Catalan generating function
- A224416: least prime giving an irreducible reduction of a reversed Catalan section
Models and asymptotic regimes for random polynomials
- Height bounds for exceptional Galois groups
Fixed degree and growing coefficient height.
- Random polynomials: models and methods
Growing degree under a specified coefficient law.
- Littlewood polynomials
Independent sign coefficients and their congruence restrictions.
- Random reciprocal polynomials of growing degree
Random coefficients with reciprocal symmetry.
- Characteristic polynomials of random matrices
Characteristic polynomials with dependent coefficients.
Specialization and inverse Galois theory
- Specialization and Hilbert irreducibility
Irreducibility and Galois groups under rational specialization.
- Exceptional specializations
Thin sets, resolvent curves, and effective exceptional-set bounds.
- Critical points and polynomial monodromy
Critical values, branch cycles, and the symmetric group.
- Branched covers and rigidity
Branch cycles, genus, and rigidity.
- Generic polynomials and invariant fields
Polynomials that parametrize all extensions with a given group.
- Inverse Galois theory and generic polynomials
Known realizations, regular extensions, and open cases.
Exact computation and certificates
- Irreducibility over finite fields
Exact irreducibility tests and the number of irreducible polynomials.
- Polynomial factorization algorithms
Finite-field factorization, Hensel lifting, and rational factor recovery.
- Resolvents and subgroup tests
Invariant expressions that distinguish candidate groups.
- Algorithms for Galois groups
Certified subgroup descent and exact group calculations.
- Factoring sparse polynomials
Degree bounds, sparse input, and the size of the output.
Composition and iteration
- Composition and iteration
Composition, iterates, and the fields generated by their roots.
- Polynomial decomposition
Ritt’s theorems and blocks in polynomial monodromy.
- Irreducibility of iterates
Capelli’s criterion and irreducibility of all iterates.
- Arboreal Galois groups
Galois actions on preimage trees and maximality questions.
- Gleason and Misiurewicz polynomials
Parameters with periodic or preperiodic critical points.
Finite fields
- Finite fields and Frobenius
Frobenius, subfields, trace, norm, and extension of constants.
- Irreducibility over finite fields
Exact irreducibility tests and the number of irreducible polynomials.
- Irreducible polynomials with coefficient restrictions
Prescribed coefficients and constructive results.
- Primitive and normal elements
Primitive, normal, and completely normal elements.
- Factorization statistics over finite fields
Factorization patterns and the analogy with permutations.
References
Several variables
- Polynomials in several variables
Ground fields, absolute irreducibility, and hypersurfaces.
- Newton polytopes and irreducibility
Minkowski sums and restrictions from exponent support.
- Polynomials with separated variables
Factorization of and the role of composition.
- Polynomial fibers and Bertini’s theorem
Irreducible generic fibers and exceptional specializations.
- Factorization in several variables
Effective tests and factorization algorithms.
Books
Introductory text
Fields and Galois Theory
Field extensions, separability, and the fundamental theorem of Galois theory; Chapter 4 gives explicit Galois-group computations.
Author’s book pageExamples and constructions
Galois Theory
Explicit polynomials, resolvents, radicals, and permutation actions, developed alongside the general theory.
SourcePolynomial theory
Polynomials
Irreducible polynomials, special forms, root properties, and Galois theory.
SourceResearch reference on reducibility
Polynomials with Special Regard to Reducibility
Structured, sparse, and multivariable polynomials, with references to the origins of the criteria.
SourceLocal fields
Local Fields
Valuations, ramification, and local extensions underlying Newton-polygon and inertia arguments.
SourcePermutation groups
Permutation Groups
Transitivity, blocks, primitivity, and cycle criteria for determining permutation groups.
SourceFinite fields
Finite Fields
Irreducible and primitive polynomials, extension fields, counting, constructions, and factorization.
SourceAlgorithms and complexity
Modern Computer Algebra
Polynomial arithmetic, finite-field algorithms, Hensel lifting, lattice reduction, and factorization over the rationals.
SourceComputational number theory
A Course in Computational Algebraic Number Theory
Defining polynomials, number fields, integral bases, discriminants, and explicit arithmetic.
SourceSpecialization and inverse Galois theory
Topics in Galois Theory
Hilbert irreducibility, thin sets, regular realizations, and sieve arguments.
SourceField arithmetic
Field Arithmetic
Hilbertian fields, PAC fields, absolute Galois groups, and specialization in the fourth edition.
SourceInverse Galois theory
Inverse Galois Theory
Regular realizations, rigidity, embedding problems, and explicit construction methods.
Source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.