Reading guide

01

Foundations

  1. Foundations: polynomials, fields, and Galois groups

    Irreducibility, fields generated by roots, and Galois actions.

  2. Field extensions and minimal polynomials

    Minimal polynomials, the tower law, embeddings, and separability.

  3. The Galois correspondence and intermediate fields

    Intermediate fields, stabilizers, composita, and changes of ground field.

02

Irreducibility and the Galois group

  1. Reduction modulo primes

    Reduction modulo primes and intersections of possible factor degrees.

  2. Frobenius and factorization modulo primes

    Factor degrees as cycle lengths in the Galois group.

  3. Transitivity, primitivity, and cycle criteria

    Blocks, primitivity, transpositions, and prime cycles.

  4. Discriminants, parity, and ramification

    Repeated roots and the sign character of the root action.

03

Valuations and Galois groups

  1. Schönemann–Eisenstein and Dumas criteria

    Coefficient divisibility and single-edge Newton polygons.

  2. Newton polygons and Galois groups

    Root valuations, local factor degrees, and inertia.

  3. Transitivity, primitivity, and cycle criteria

    Blocks, primitivity, transpositions, and prime cycles.

  4. Taylor polynomials

    Exponential and geometric truncations; recent claims for shifted exponentials.

  5. Generalized Laguerre polynomials

    Coefficient products and the distinction between fixed degree and fixed parameter.

04

Irreducibility and Galois groups in families

  1. Reciprocal polynomials

    The trace polynomial and the quadratic extensions above its roots.

  2. Sparse polynomials and factor reversal

    Cyclotomic factors, reciprocal factors, and large exponent gaps.

  3. Trinomials

    The family xn−x−1x^n-x-1 and its group SnS_n.

  4. Eulerian polynomials

    Descent statistics, reciprocal symmetry, and prime-index irreducibility.

  5. Fekete polynomials

    Character coefficients, forced factors, and inverse root pairs.

  6. Hermite, Bessel, and Legendre polynomials

    Hermite, Bessel, and Legendre polynomials, with their precise normalizations.

  7. Ehrhart polynomials

    Lattice-point counting and polynomial factorization.

05

Taylor polynomials and Katz–Rivin questions

  1. Taylor polynomials

    Exponential and geometric truncations; recent claims for shifted exponentials.

  2. Taylor polynomials and Katz–Rivin questions

    Katz–Rivin questions and preprint claims for prescriptions, binomial sections, and Catalan sections.

  3. Specialization and Hilbert irreducibility

    Irreducibility and Galois groups under rational specialization.

  4. Newton polygons and Galois groups

    Root valuations, local factor degrees, and inertia.

06

Models and asymptotic regimes for random polynomials

  1. Height bounds for exceptional Galois groups

    Fixed degree and growing coefficient height.

  2. Random polynomials: models and methods

    Growing degree under a specified coefficient law.

  3. Littlewood polynomials

    Independent sign coefficients and their congruence restrictions.

  4. Random reciprocal polynomials of growing degree

    Random coefficients with reciprocal symmetry.

  5. Characteristic polynomials of random matrices

    Characteristic polynomials with dependent coefficients.

07

Specialization and inverse Galois theory

  1. Specialization and Hilbert irreducibility

    Irreducibility and Galois groups under rational specialization.

  2. Exceptional specializations

    Thin sets, resolvent curves, and effective exceptional-set bounds.

  3. Critical points and polynomial monodromy

    Critical values, branch cycles, and the symmetric group.

  4. Branched covers and rigidity

    Branch cycles, genus, and rigidity.

  5. Generic polynomials and invariant fields

    Polynomials that parametrize all extensions with a given group.

  6. Inverse Galois theory and generic polynomials

    Known realizations, regular extensions, and open cases.

08

Exact computation and certificates

  1. Irreducibility over finite fields

    Exact irreducibility tests and the number of irreducible polynomials.

  2. Polynomial factorization algorithms

    Finite-field factorization, Hensel lifting, and rational factor recovery.

  3. Resolvents and subgroup tests

    Invariant expressions that distinguish candidate groups.

  4. Algorithms for Galois groups

    Certified subgroup descent and exact group calculations.

  5. Factoring sparse polynomials

    Degree bounds, sparse input, and the size of the output.

09

Composition and iteration

  1. Composition and iteration

    Composition, iterates, and the fields generated by their roots.

  2. Polynomial decomposition

    Ritt’s theorems and blocks in polynomial monodromy.

  3. Irreducibility of iterates

    Capelli’s criterion and irreducibility of all iterates.

  4. Arboreal Galois groups

    Galois actions on preimage trees and maximality questions.

  5. Gleason and Misiurewicz polynomials

    Parameters with periodic or preperiodic critical points.

10

Finite fields

  1. Finite fields and Frobenius

    Frobenius, subfields, trace, norm, and extension of constants.

  2. Irreducibility over finite fields

    Exact irreducibility tests and the number of irreducible polynomials.

  3. Irreducible polynomials with coefficient restrictions

    Prescribed coefficients and constructive results.

  4. Primitive and normal elements

    Primitive, normal, and completely normal elements.

  5. Factorization statistics over finite fields

    Factorization patterns and the analogy with permutations.

11

Several variables

  1. Polynomials in several variables

    Ground fields, absolute irreducibility, and hypersurfaces.

  2. Newton polytopes and irreducibility

    Minkowski sums and restrictions from exponent support.

  3. Polynomials with separated variables

    Factorization of f(X)−g(Y)f(X)-g(Y) and the role of composition.

  4. Polynomial fibers and Bertini’s theorem

    Irreducible generic fibers and exceptional specializations.

  5. Factorization in several variables

    Effective tests and factorization algorithms.

Books

Examples and constructions

Galois Theory

Cox, David A.

Explicit polynomials, resolvents, radicals, and permutation actions, developed alongside the general theory.

Source

Polynomial theory

Polynomials

Prasolov, Victor V.

Irreducible polynomials, special forms, root properties, and Galois theory.

Source

Local fields

Local Fields

Serre, Jean-Pierre

Valuations, ramification, and local extensions underlying Newton-polygon and inertia arguments.

Source

Permutation groups

Permutation Groups

Dixon, John D. and Mortimer, Brian

Transitivity, blocks, primitivity, and cycle criteria for determining permutation groups.

Source

Finite fields

Finite Fields

Lidl, Rudolf and Niederreiter, Harald

Irreducible and primitive polynomials, extension fields, counting, constructions, and factorization.

Source

Algorithms and complexity

Modern Computer Algebra

von zur Gathen, Joachim and Gerhard, Jürgen

Polynomial arithmetic, finite-field algorithms, Hensel lifting, lattice reduction, and factorization over the rationals.

Source

Specialization and inverse Galois theory

Topics in Galois Theory

Serre, Jean-Pierre

Hilbert irreducibility, thin sets, regular realizations, and sieve arguments.

Source

Field arithmetic

Field Arithmetic

Fried, Michael D. and Jarden, Moshe

Hilbertian fields, PAC fields, absolute Galois groups, and specialization in the fourth edition.

Source

Inverse Galois theory

Inverse Galois Theory

Malle, Gunter and Matzat, B. Heinrich

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.