Composition 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.
ArticleReferences
- The Galois Theory of Iterates and Composites of PolynomialsOdoni, R. W. K. · 1985
Studies Galois groups under composition and iteration. In characteristic zero, the iterates of the generic degree-d polynomial have the full iterated wreath-product group, giving finite-level specialization results and motivating arboreal questions.
- Galois groups over Q of some iterated polynomialsStoll, Michael · 1992
Characterizes maximality of iterated quadratic Galois groups through arithmetic square-class conditions, relating critical orbits to the growth of splitting fields.
- Irreducibility of the iterates of a quadratic polynomial over a fieldAyad, Mohamed and McQuillan, Donald L. · 2000
Develops criteria for irreducibility of successive quadratic iterates. Read it together with the authors' 2001 correction before using the stated tests in a proof or computation.
- Corrections to "Irreducibility of the iterates of a quadratic polynomial over a field" (Acta Arith. 93 (2000), 87--97)Ayad, Mohamed and McQuillan, Donald L. · 2001
Corrects Ayad and McQuillan’s quadratic-iteration paper and should be read with the original article.
- An iterative construction of irreducible polynomials reducible modulo every primeJones, Rafe · 2012
Constructs polynomials of arbitrarily large degree that are irreducible over Q, and over suitable other global fields, but reducible modulo every prime. Failure to find an irreducible reduction is therefore not evidence of reducibility over the ground field.
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.