Overview
- Which polynomial records an exact critical period or tail?
- Which irreducibility cases are known?
- How do these parameter polynomials relate to dynatomic curves?
- What changes in higher degree?
Critical points and parameters
For , the finite critical point is . As varies, its orbit is
It is periodic if it returns to , and strictly preperiodic if it enters a cycle without returning to . The tail length is the first time it enters the cycle; the period is the cycle length. For a strictly preperiodic critical point in this family, .
These conditions are polynomial equations in . To obtain exact period and tail, one removes the factors belonging to shorter orbits. The resulting arithmetic questions concern the parameters , rather than roots of an iterate for a fixed parameter.
References 1
- BenedettoGoksel2026NonUnit · Introduction and equation (1)Source
Gleason polynomials
Set and . The Gleason polynomial is
Its roots are exactly the parameters for which has exact period . Möbius inversion gives , and hence
The conjecture that every is irreducible over says that the exact-period parameters form one Galois orbit. Ramadas records verification for . The 2026 necklace paper still states the general conjecture.
A stronger conjecture asks whether for every . Schleicher states the symmetric-group conjecture for centers of fixed period.
Normalization in Schleicher’s statement
The displayed definition before Conjecture 7.2 uses . Its recursively defined exact-period factors are therefore , which are not irreducible. We interpret the conjecture as concerning the reduced polynomial , in accordance with the accompanying description of the centers. This is an explicit interpretation of the source, not its literal polynomial formula.
References 3
- Ramadas2024Moduli · IntroductionSource
- BakerChenLiQian2026Necklaces · Introduction, footnote 1Source
- Schleicher2017Galois · Conjecture 7.2 and the preceding definition, p. 28The stated conjecture is interpreted for the reduced exact-period polynomial; see the normalization note.Source
Example
The first three polynomials are
The reduction has no root in , so it is irreducible. Its discriminant is ; therefore its Galois group over is .
At period four,
The two factors are irreducible over . Thus this prime gives the cycle type , but does not prove irreducibility over . Buff–Floyd–Koch–Parry prove that the number of irreducible factors modulo equals the number of real roots. Baker–Chen–Li–Qian give a later description using binary necklaces and construct a bijection. The group at period four can nevertheless be determined by combining other primes, as follows.
References 2
- BuffFloydKochParry2022 · Theorems 1.5–1.6, p. 789The real-root count in Theorem 1.5 is attributed there to Lutzky.Source
- BakerChenLiQian2026Necklaces · Introduction and Theorem AThe cubic discriminant and small factorizations are checked directly.Source
The Galois group at period four
Example
The polynomial has Galois group over .
Modulo , write . Direct reduction gives
Also , and the identity
holds in . Thus . The finite-field irreducibility criterion proves that , and hence , is irreducible.
At two further primes the factorizations into distinct irreducibles are
Frobenius supplies a 5-cycle and an element of cycle type . In a transitive degree-six action, the 5-cycle makes the stabilizer of its fixed point transitive on the other points. Thus the group is doubly transitive, hence primitive. Cubing the element gives a transposition. A primitive group containing a transposition is .
Finite-field checks
The non-linear factors at and all have prime degree . For each factor , the identities below give and polynomials satisfying in . Repeated modular powering gives . These two conditions prove irreducibility.
Modulo 13
Cubic factor modulo 31
Quadratic factor modulo 31
The displayed products equal modulo their primes. Distinct irreducible factors of different degrees are coprime, so both reductions are squarefree.
References 3
- ConradModP · Factorization and Frobenius cycle typesThe arithmetic for G₄ is displayed here.Source
- LidlNiederreiter1997 · Chapter 3, irreducible polynomialsFrobenius and gcd criterion used in the finite-field checks.Source
- ConradSnAnPrimitive groups containing a transposition.Source
Misiurewicz polynomials
For , let . Fix , , and a nontrivial -th root of unity . The normalized Misiurewicz polynomial is
It is monic in . Its roots have exact critical tail , period , and collision relation . The factor in the denominator removes periodic critical parameters.
Conjecture 1.1 of Benedetto–Goksel predicts irreducibility over . The known cases they record include ; ; and prime-power with . For , write . For example, , whose root gives the orbit .
References 1
- BenedettoGoksel2024UnitsII · Equation (2), Conjecture 1.1 and the following paragraphSource
Polynomial values and algebraic units
Let be a root of for the quadratic family , with , and suppose divides . The non-unit conjecture predicts that is not an algebraic unit. Benedetto–Goksel prove this when is a prime at most , assuming both and are irreducible over .
The value is a product of differences between and roots of . A non-unit product shows that at least one difference is a non-unit. To conclude this for every difference, one needs further Galois information, such as irreducibility over .
References 1
- BenedettoGoksel2026NonUnit · Introduction, Questions 1.1–1.2 and Theorem 1.3Source
A higher-degree exception
The quadratic conjecture does not extend unchanged to every degree. Buff uses the family , . Its exact-period-three parameter polynomial is reducible over if and only if . In that case it has exactly two irreducible factors, one equal to .
This is a statement in the parameter for the displayed normalization. For and , the change conjugates to , linking Buff’s normalization to the quadratic family above.
References 1
- Buff2018PCF · Proposition 5Source
Dynatomic curves and parameter polynomials
For , define the dynatomic polynomial
The affine curve is smooth and irreducible over . Smoothness is due to Douady–Hubbard; irreducibility was proved by Bousch and independently by Lau–Schleicher. Buff–Tan give accessible new proofs using quadratic differentials and kneading sequences. Its intersection with is the equation . Irreducibility of the curve does not imply irreducibility of this intersection over .
A different curve, , parametrizes quadratic rational maps with an -periodic critical point. Ramadas proves, for , that irreducibility of over implies irreducibility of over . Her argument uses a smooth rational point on a suitable projective completion.
References 6
- DouadyHubbard1984Part I of the original notes; background on the quadratic family.Source
- DouadyHubbard1985Part II; original smoothness attribution is recorded in Buff–Tan, Theorem 1.1.Source
- Bousch1992Thesis · Chapter 3Original thesis attribution via Buff–Tan and Krumm; full thesis not retrieved in this review.Source
- LauSchleicher1994Original independent approach to irreducibility; see also Schleicher 2017.Source
- BuffTan2014Dynatomic · Theorems 1.1–1.2Source
- Ramadas2024Moduli · Theorems 1.1 and 1.3Source
Preperiodic curves and rational points
For , the irreducible factors of , , define curves parametrizing preperiodic points. Doyle–Poonen prove that, over a field containing all -th roots of unity and with characteristic not dividing , each such irreducible component is geometrically irreducible.
They also prove that the gonalities of these distinct curves tend to infinity: for each bound, only finitely many have gonality below it. Here gonality is the least degree of a nonconstant map over from the smooth projective curve to . Over a function field , this gives a uniform bound for preperiodic points in extensions of bounded degree when is not algebraic over ; for finite , that restriction on can be removed. Over number fields of bounded degree, a uniform bound holds for preperiodic points of bounded eventual period.
References 1
- DoylePoonen2020Gonality · Theorems 1.1, 1.7, and 1.8; §1.1 defines the curves as irreducible componentsSource
Questions
Are all quadratic Gleason polynomials irreducible?
Scope. G_n(c) over Q, for every integer n≥1
The conjecture asks whether the exact-period parameters form a single Galois orbit for every . Verification through is recorded by Ramadas; the 2026 necklace paper still states the general conjecture.
References 2
- Ramadas2024Moduli · IntroductionSource
- BakerChenLiQian2026Necklaces · Introduction, footnote 1Source
Do all quadratic Gleason polynomials have full symmetric Galois group?
Scope. Every integer n≥1; the reduced exact-period polynomial G_n over Q
Define , , and . The conjecture asserts that is irreducible and
Schleicher’s Conjecture 7.2 is interpreted here for these reduced polynomials. Its preceding displayed definition introduces squares; the article gives the normalization calculation. Periods three and four have groups and , respectively, by the displayed examples.
References 1
- Schleicher2017Galois · Conjecture 7.2 and preceding definition, p. 28Reduced-polynomial interpretation, not a literal repetition of the source formula.Source
Are the normalized Misiurewicz polynomials irreducible?
Scope. d,m≥2; n≥1; ζ≠1 a d-th root of unity; base field Q(ζ)
Conjecture 1.1 asserts irreducibility of . Even the full quadratic family remains unresolved in the cited 2026 paper. Removing lower-period factors and fixing are part of the statement.
References 2
- BenedettoGoksel2024UnitsII · Conjecture 1.1Source
- BenedettoGoksel2026NonUnit · Introduction before Question 1.1Source
Are the remaining Misiurewicz values always non-units?
Scope. m≥2; 1≤ℓ<n with ℓ|n; c₀ a root of quadratic G_{m,n}
Must fail to be an algebraic unit? The 2026 result covers prime under irreducibility assumptions, and leaves the general case open.
References 2
- BenedettoGoksel2026NonUnit · Introduction and Theorem 1.3Source
- BenedettoGoksel2024UnitsII · Conjecture 1.3Source
Determine the Galois groups of Misiurewicz polynomials.
Scope. Normalized G_{d,m,n}^ζ over Q(ζ), with d,m≥2, n≥1, ζ^d=1 and ζ≠1
For , let be the monic polynomial whose roots have exact critical tail , period , and collision relation , where . Determine its permutation group over . The article gives the normalization removing periodic critical parameters. The general irreducibility problem remains open; the symmetric-group conjecture for quadratic Gleason polynomials is a separate question.
References 1
- BenedettoGoksel2024UnitsII · Equation (2), Conjecture 1.1 and the following discussionSource
Related topics
Composition and iteration
Critical-orbit equations arise from iteration.
RelatedArboreal Galois groups
Critical orbits also govern Galois groups of preimages.
RelatedPolynomials in several variables
Irreducibility of a curve differs from irreducibility of a section.
RelatedSpecialization and Hilbert irreducibility
A parameter polynomial differs from a specialized dynatomic polynomial.
RelatedReduction modulo primes
Reduction certifies individual examples.
Linked from 2 articles
References
- The non-unit conjecture for Misiurewicz parameters
Benedetto, Robert L. and Goksel, Vefa. Acta Arithmetica, 224(2), 117–139, 2026.
Read the source - Moduli Spaces of Quadratic Maps: Arithmetic and Geometry
Ramadas, Rohini. International Mathematics Research Notices, 2024(15), 11364–11370, 2024.
Read the source - Necklaces, permutations, and periodic critical orbits for quadratic polynomials
Baker, Matthew and Chen, Andrea and Li, Sophie and Qian, Matthew. European Journal of Combinatorics, 134, 104352, 2026.
Read the source - Internal Addresses of the Mandelbrot Set and Galois Groups of Polynomials
Schleicher, Dierk. Arnold Mathematical Journal, 3, 1–35, 2017.
Read the source - Factoring Gleason polynomials modulo 2
Buff, Xavier and Floyd, William and Koch, Sarah and Parry, Walter. Journal de théorie des nombres de Bordeaux, 34(3), 787–812, 2022.
Read the source - Galois groups over Q and factorizations mod p
Conrad, Keith. Author-hosted expository note.
Read the source - Finite Fields
Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.
Read the source - Recognizing Galois groups S_n and A_n
Conrad, Keith. Author-hosted expository note.
Read the source - Misiurewicz polynomials and dynamical units, part II
Benedetto, Robert L. and Goksel, Vefa. Research in Number Theory, 10, 58, 2024.
Read the source - On postcritically finite unicritical polynomials
Buff, Xavier. New York Journal of Mathematics, 24, 1111–1122, 2018.
Read the source - Étude dynamique des polynômes complexes. Première partie
Douady, Adrien and Hubbard, John H. Publications mathématiques d’Orsay 84-02, Université de Paris-Sud, Orsay, Report 84-02, 1984.
Read the source - Étude dynamique des polynômes complexes. Deuxième partie
Douady, Adrien and Hubbard, John H. Publications mathématiques d’Orsay 85-04, Université de Paris-Sud, Orsay, Report 85-04, 1985.
Read the source - Sur quelques problèmes de dynamique holomorphe
Bousch, Thierry. Université de Paris-Sud, Orsay, 1992.
Read the source - Internal addresses in the Mandelbrot set and irreducibility of polynomials
Lau, Eike and Schleicher, Dierk. Stony Brook Institute for Mathematical Sciences, Preprint 1994/19, 1994.
Read the source - The quadratic dynatomic curves are smooth and irreducible
Buff, Xavier and Tan, Lei. Frontiers in Complex Dynamics: In Celebration of John Milnor's 80th Birthday, Princeton University Press, 49–72, 2014.
Read the source - Gonality of dynatomic curves and strong uniform boundedness of preperiodic points
Doyle, John R. and Poonen, Bjorn. Compositio Mathematica, 156(4), 733–743, 2020.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.