Overview

  • Why do iterated Galois groups lie in wreath products?
  • How are stability and maximality different?
  • How do square classes determine quadratic groups?
  • When can a finite level determine the infinite group?

The preimage tree

Let f∈K[x]f\in K[x] have degree d≥2d\ge2, and fix a∈Ka\in K. Suppose f∘n(x)−af^{\circ n}(x)-a has dnd^n distinct roots for every nn. Make these roots the vertices at level nn, keep separate copies at different levels, and join β\beta to f(β)f(\beta). Level zero consists of aa. Each vertex has dd children.

If LnL_n is the splitting field of f∘n(x)−af^{\circ n}(x)-a, then Ln−1⊆LnL_{n-1}\subseteq L_n. Every element of Gn=Gal⁡(Ln/K)G_n=\operatorname{Gal}(L_n/K) preserves the tree because σ(f(β))=f(σ(β))\sigma(f(\beta))=f(\sigma(\beta)). Passing to all levels gives the arboreal representation

ρf,a:Gal⁡(K‾/K)⟶Aut⁡(Td,∞).\rho_{f,a}:\operatorname{Gal}(\overline K/K)\longrightarrow\operatorname{Aut}(T_{d,\infty}).

In characteristic zero, the separability assumption is equivalent to saying that aa is not a positive iterate of any critical point of ff.

References 2

The largest possible tree group

A tree automorphism may permute the dd branches at the root and act independently on each branch. Consequently,

Aut⁡(Td,n)≅Aut⁡(Td,n−1)d⋊Sd,∣Aut⁡(Td,n)∣=(d!)(dn−1)/(d−1).\operatorname{Aut}(T_{d,n})\cong\operatorname{Aut}(T_{d,n-1})^d\rtimes S_d,\qquad |\operatorname{Aut}(T_{d,n})|=(d!)^{(d^n-1)/(d-1)}.

This is the iterated wreath product of SdS_d. For n≥2n\ge2, the tree group Aut⁡(Td,n)\operatorname{Aut}(T_{d,n}) is a proper subgroup of SdnS_{d^n}. For example, a quadratic second iterate has a group inside the order-eight group C2≀C2C_2\wr C_2.

Transitivity of GnG_n is equivalent to irreducibility of f∘n(x)−af^{\circ n}(x)-a. Surjectivity of ρf,a\rho_{f,a} means equality with the full tree group at every level. Finite index permits some failure of maximality but bounds the indices [Aut⁡(Td,n):Gn][\operatorname{Aut}(T_{d,n}):G_n] independently of nn.

References 1

Stability and the size of the image

Let HH be the closed arboreal image in W=Aut⁡(Td,∞)W=\operatorname{Aut}(T_{d,\infty}), with the regular, separable preimage tree defined above. The pair f,af,a is stable if every f∘n(x)−af^{\circ n}(x)-a is irreducible over KK, and eventually stable if the number of irreducible factors is bounded independently of nn. Then

H=W⟹stability⟹eventual stability,H=W\Longrightarrow\text{stability}\Longrightarrow\text{eventual stability},H=W⟹[W:H]<∞⟹eventual stability.H=W\Longrightarrow[W:H]<\infty\Longrightarrow\text{eventual stability}.

If [W:H]=I[W:H]=I, then HH has at most II orbits on each level: if W=⋃j=1IHwjW=\bigcup_{j=1}^I Hw_j and vv is any vertex on the level, then its vertices lie in the orbits H(wjv)H(w_jv). These orbits are the irreducible factors of the corresponding preimage polynomial.

Polynomial and base field; target 00Factorization of iteratesArboreal image
x2+1x^2+1 over Q\mathbb QEvery iterate is irreducible.Full image, by Stoll.
x2−2x^2-2 over Q\mathbb QEvery iterate is irreducible.Infinite index; the level-nn group is C2nC_{2^n}.
x2+1x^2+1 over Q(i)\mathbb Q(i)Exactly two irreducible factors at every positive level.Index two.

The cyclotomic calculation for x2−2x^2-2 is given below. For the last row, the first splitting field over Q\mathbb Q is Q(i)\mathbb Q(i). Base change therefore replaces the full binary tree group by the kernel of its action on level one. This subgroup has index two and acts transitively on each of the two branches. Thus finite index need not imply stability, and stability need not imply finite index.

References 3

A quadratic maximality criterion

Theorem

Let KK have characteristic different from two, let f=x2+c∈K[x]f=x^2+c\in K[x], and set

aj=f∘j(0),b1=−c,bj=aj(j≥2).a_j=f^{\circ j}(0),\qquad b_1=-c,\qquad b_j=a_j\quad(j\ge2).

Fix n≥1n\ge1 and suppose a1⋯an≠0a_1\cdots a_n\ne0. Then the splitting field of f∘nf^{\circ n} has group Wn=Aut⁡(T2,n)W_n=\operatorname{Aut}(T_{2,n}) if and only if [b1],…,[bn][b_1],\ldots,[b_n] are linearly independent in K×/K×2K^\times/K^{\times2}. Thus no nonempty product of the bjb_j may be a square in KK.

Proof

For 1≤j≤n1\le j\le n, let ϵj:Wn→{±1}\epsilon_j:W_n\to\{\pm1\} be the sign of the permutation on level jj. The decomposition Wn=(Wn−1×Wn−1)⋊C2W_n=(W_{n-1}\times W_{n-1})\rtimes C_2 gives Wnab≅C2nW_n^{\mathrm{ab}}\cong C_2^n: in the abelianization, the top swap identifies the two branch copies of Wn−1abW_{n-1}^{\mathrm{ab}}. A swap at one vertex of level j−1j-1 has negative sign on level jj and positive sign at every other level. Hence the ϵj\epsilon_j form a basis of the quadratic characters of WnW_n.

Every proper subgroup of the finite 2-group WnW_n lies in a subgroup of index two. Therefore G≤WnG\le W_n is all of WnW_n exactly when no nontrivial product of the ϵj\epsilon_j is trivial on GG.

Put Fj=f∘jF_j=f^{\circ j}. The derivative and resultant formulas give

Fj′=2j∏r=0j−1f∘r,disc⁡(Fj)=(−1)2j(2j−1)/22j2j∏k=1jak2j−k.F_j'=2^j\prod_{r=0}^{j-1}f^{\circ r},\qquad \operatorname{disc}(F_j)=(-1)^{2^j(2^j-1)/2}2^{j2^j}\prod_{k=1}^j a_k^{2^{j-k}}.

Indeed, Res⁡(Fj,f∘r)=aj−r2r\operatorname{Res}(F_j,f^{\circ r})=a_{j-r}^{2^r}. The discriminant classes are consequently [−c][-c] for j=1j=1, and [aj][a_j] for j≥2j\ge2. The discriminants are nonzero by hypothesis, so all these polynomials are separable.

The action on a square root of a discriminant is the sign character on the roots. Kummer theory identifies products of these characters with products of the corresponding square classes. The preceding subgroup criterion now gives the equivalence.

References 3

Example

For x2+1x^2+1, the first three adjusted critical values are −1,2,5-1,2,5. A product containing −1-1 is negative; the remaining nonempty products 2,5,102,5,10 are nonsquares. Hence the Galois group through level three is the full binary tree group, of order 21+2+4=1282^{1+2+4}=128. Stoll’s theorem proves maximality at every level for this polynomial.

A useful sufficient condition for independence is the following: for each bjb_j, find a prime pjp_j such that vpj(bj)v_{p_j}(b_j) is odd and vpj(bi)v_{p_j}(b_i) is even for every i<ji<j. In a nonempty product, the prime belonging to the largest index then has odd valuation. This explains why new prime divisors of critical values often prove maximality.

References 1

An even-degree criterion

Kadets extends the square-class approach to even degree. Assume char⁡K≠2\operatorname{char}K\ne2, deg⁡f=d\deg f=d is even, the target aa is not periodic, and all preimage equations are separable. Suppose that, for every n≥0n\ge0 and every α∈f−n(a)\alpha\in f^{-n}(a), the polynomial f(x)−αf(x)-\alpha has Galois group SdS_d over K(α)K(\alpha). If

disc⁡(f∘n(x)−a),n≥1,\operatorname{disc}(f^{\circ n}(x)-a),\qquad n\ge1,

are independent in K×/K×2K^\times/K^{\times2}, then the arboreal representation is surjective. Both assumptions matter: the square classes control how the extensions fit together, while the fiber groups supply the full symmetric action at each vertex.

References 1

A stable polynomial with cyclic groups

Let f=x2−2f=x^2-2. The identity

f(z+z−1)=z2+z−2f(z+z^{-1})=z^2+z^{-2}

gives an exact description of the roots of every iterate. If ζ\zeta is a primitive 2n+22^{n+2}-th root of unity, then ζ+ζ−1\zeta+\zeta^{-1} is a root of f∘nf^{\circ n} and has degree φ(2n+2)/2=2n\varphi(2^{n+2})/2=2^n. Thus f∘nf^{\circ n} is irreducible over Q\mathbb Q.

All its roots lie in Q(ζ+ζ−1)\mathbb Q(\zeta+\zeta^{-1}), so this is also its splitting field. Therefore

Gn≅(Z/2n+2Z)×/{±1}≅C2n.G_n\cong(\mathbb Z/2^{n+2}\mathbb Z)^\times/\{\pm1\}\cong C_{2^n}.

The group is transitive at every level but has infinite index in the full binary tree group. The critical orbit 0↦−2↦2↦20\mapsto-2\mapsto2\mapsto2 is finite.

References 1

Generic groups and arithmetic examples

For a generic monic polynomial F=xd+td−1xd−1+⋯+t0F=x^d+t_{d-1}x^{d-1}+\cdots+t_0 over a characteristic-zero coefficient field, Odoni proves that every iterate has the full nn-fold wreath product. Juul extends the generic theorem to positive characteristic, with the exception (d,char⁡K)=(2,2)(d,\operatorname{char}K)=(2,2).

A fixed finite level can be studied by Hilbert irreducibility. Obtaining one specialization that works at every level requires further arithmetic: infinitely many separate applications of Hilbert irreducibility do not by themselves produce a common specialization. Looper, Benedetto–Juul, and Specter construct arithmetic examples using local conditions that persist through the tower.

References 5

Recent work

For targets outside the forward critical orbit, the periodic and strictly preperiodic postcritically finite quadratic cases are treated by Benedetto–Ghioca–Juul–Tucker in papers published in 2025 and 2026. Their groups record the critical-orbit relations; maximality in those descriptions is relative to the specified constrained group.

A March 2026 preprint by Henderson–Juul–Lattin–Mercado–Schaefer gives new surjective representations for quadratic polynomials with specified strictly preperiodic targets. For example, their Theorem 2 applies to

f=x2−1316,a=14,f=x^2-\frac{13}{16},\qquad a=\frac14,

since a−(−13/16)=17/16a-(-13/16)=17/16 is a nonsquare and the denominator 44 satisfies the stated condition. Here a↦−3/4↦−1/4↦−3/4a\mapsto-3/4\mapsto-1/4\mapsto-3/4. The claimed surjectivity concerns the polynomials f∘n(x)−af^{\circ n}(x)-a, with this target.

References 3

Finite-level detection

For f=x2+cf=x^2+c, c∈Q∖{−1,0}c\in\mathbb Q\setminus\{-1,0\}, Stoll’s November 2026 preprint proves that maximality at level two implies maximality at all levels in explicitly specified regions and congruence classes of cc. It also records the general conjecture that level four suffices.

The fourth level cannot be replaced by the third. For c=2/3c=2/3,

(b1,b2,b3,b4)=(−23,109,15481,280906561).(b_1,b_2,b_3,b_4)=\left(-\frac23,\frac{10}{9},\frac{154}{81},\frac{28090}{6561}\right).

The first three classes are independent: the sign detects the first, the prime 55 detects the second, and the prime 77 detects the third. But

b2b4=(530243)2.b_2b_4=\left(\frac{530}{243}\right)^2.

Thus the first three groups are maximal and the fourth is not.

References 2

Connections and evidence

Claimed · preprint

From critical square classes to every quadratic iterate

At each finite level, square-class independence is equivalent to the full binary-tree Galois group. A 2026 preprint extends a two-level check to every level under explicit parameter conditions.

Scope. fc=X2+cf_c=X^2+c over Q\mathbb Q, target zero, c∉{−1,0}c\notin\{-1,0\}. The finite-to-infinite step here is the positive subfamily c=r/s>0c=r/s>0, with r,sr,s coprime positive integers, ss even and r≡3(mod4)r\equiv3\pmod4.

From critical square classes to every quadratic iterateAt each finite level, square-class independence is equivalent to the full binary-tree Galois group. A 2026 preprint extends a two-level check to every level under explicit parameter conditions. Connection 1: Critical orbit of x²+c is an input to First two classes independent. Compute b₁=-c and b₂=c²+c and test that neither class nor their product is a square. Connection 2: First two classes independent is equivalent to Full Galois group at level two. The first two adjusted critical classes are independent exactly when the second-level Galois group is the full order-eight binary-tree group. Connection 3: First two classes independent is an input to AND. The initial independence check is combined with the stated parameter conditions. Connection 4: c > 0; s even; r ≡ 3 mod 4 is an input to AND. The congruences are imposed on the coprime positive numerator r and denominator s. Connection 5: AND leads to Characters separate every index. For the stated positive parameter subfamily, the initial conditions and the congruences produce quadratic characters separating every adjusted critical value from all later values. Preprint claim. Connection 6: Characters separate every index is equivalent to All critical classes independent. Characters taking value -1 at one index and +1 at all later indices exist for every index exactly when the critical square classes are independent. Connection 7: All critical classes independent is equivalent to Full binary-tree group at every level. Independence of the infinite family means independence of every finite prefix, hence maximality at every finite level. Connection 8: Full binary-tree group at every level leads to Every iterate is irreducible. The full binary-tree group acts transitively on the roots of each iterate, so each iterate is irreducible over Q.Critical orbit of x²+c — related articleCritical orbit of x²+cFirst two classes independent — related articleFirst two classesindependentFull Galois group at level two — related articleFull Galois group at leveltwoc > 0; s even; r ≡ 3 mod 4 — related articlec > 0; s even; r ≡ 3 mod 4ANDANDCharacters separate every index — related articleCharacters separateevery indexAll critical classes independent — related articleAll critical classesindependentFull binary-tree group at every level — related articleFull binary-tree group atevery levelEvery iterate is irreducible — related articleEvery iterate isirreducibleConnection 1: Compute b₁=-c and b₂=c²+c and test that neither class nor their product is a square.Compute the first twovalues [1]Connection 2: The first two adjusted critical classes are independent exactly when the second-level Galois group is the full order-eight binary-tree group.Classical finite-levelcriterion [2]Connection 3: The initial independence check is combined with the stated parameter conditions.Joint input [3]Connection 4: The congruences are imposed on the coprime positive numerator r and denominator s.Joint input [4]Connection 5: For the stated positive parameter subfamily, the initial conditions and the congruences produce quadratic characters separating every adjusted critical value from all later values.Stoll: Theorem 6.1(1)[5]Connection 6: Characters taking value -1 at one index and +1 at all later indices exist for every index exactly when the critical square classes are independent.Separating-charactercriterion [6]Connection 7: Independence of the infinite family means independence of every finite prefix, hence maximality at every finite level.Classical criterion atevery level [7]Connection 8: The full binary-tree group acts transitively on the roots of each iterate, so each iterate is irreducible over Q.Transitivity on everylevel [8]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flow equivalence preprint claimAND joint hypotheses

For fc(X)=X2+cf_c(X)=X^2+c, set b1=−cb_1=-c and bj=fc∘j(0)b_j=f_c^{\circ j}(0) for j≥2j\ge2. The sign change at the first term is essential. If c∈Q∖{−1,0}c\in\mathbb Q\setminus\{-1,0\}, all these values are nonzero and the preimages of zero form a regular binary tree. Write Gn=Gal⁡(fc∘n/Q)G_n=\operatorname{Gal}(f_c^{\circ n}/\mathbb Q).

Classical criterion. For every n≥1n\ge1,

Gn=Aut⁡(Tn)  ⟺  [b1],…,[bn] are independent in Q×/Q×2.G_n=\operatorname{Aut}(T_n)\iff[b_1],\ldots,[b_n]\text{ are independent in }\mathbb Q^\times/\mathbb Q^{\times2}.

Independence means that no nonempty product is a square.

Restricted preprint criterion, Stoll v1. Let c=r/s>0c=r/s>0 in lowest terms, with r,s>0r,s>0, ss even and r≡3(mod4)r\equiv3\pmod4. Theorem 6.1(1), using Lemma 4.3(C3), implies that independence of [−c][-c] and [c2+c][c^2+c] gives Gn=Aut⁡(Tn)G_n=\operatorname{Aut}(T_n) for every n≥1n\ge1. The initial check is automatic: b1<0b_1<0 and b1b2<0b_1b_2<0, while b2=r(r+s)/s2b_2=r(r+s)/s^2 is positive and nonsquare. Indeed, r≡3(mod4)r\equiv3\pmod4 supplies a prime q∣rq\mid r with odd vq(r)v_q(r), and coprimality gives vq(b2)=vq(r)v_q(b_2)=v_q(r).

For c=3/2c=3/2, the initial classes are [−6][-6] and [15][15]. Neither these nor their product is a square. The conclusion is

Gn=Aut⁡(Tn),∣Gn∣=22n−1(n≥1).G_n=\operatorname{Aut}(T_n),\qquad |G_n|=2^{2^n-1}\quad(n\ge1).

The proof constructs characters distinguishing each critical value from all later values. The congruence conditions are part of the finite-to-infinite step; level-two maximality alone is insufficient for arbitrary rational parameters.

Why this parameter family works

Following Stoll’s character argument, write

bn=rwns2n−1,w1=−1,wn+1=rwn2+s2n−1.b_n=\frac{rw_n}{s^{2^{n-1}}},\qquad w_1=-1,\qquad w_{n+1}=rw_n^2+s^{2^n-1}.

The recurrence gives gcd⁡(wn,rs)=gcd⁡(wn,wn+1)=1\gcd(w_n,rs)=\gcd(w_n,w_{n+1})=1. For the prime qq above, ϕ0(x)=(−1)vq(x)\phi_0(x)=(-1)^{v_q(x)} is −1-1 on every bnb_n. The sign character is −1-1 on b1b_1 and +1+1 on all later terms.

For n≥2n\ge2, put vn=wn+1+wns2n−1v_n=w_{n+1}+w_ns^{2^{n-1}}. Positivity and the congruences give vn>0v_n>0 and vn≡3(mod4)v_n\equiv3\pmod4. Hence a prime p≡3(mod4)p\equiv3\pmod4 divides vnv_n. The recurrence and coprimalities imply p∤rswnwn+1p\nmid rsw_nw_{n+1}, so

bn+1≡−bn(modp),bm≡bn+1(modp)(m>n).b_{n+1}\equiv-b_n\pmod p,\qquad b_m\equiv b_{n+1}\pmod p\quad(m>n).

The quadratic residue character of the pp-adic unit part therefore takes opposite signs on bnb_n and its entire tail. Either this character or its product with ϕ0\phi_0 sends bnb_n to −1-1 and all later terms to +1+1. Such a character at every index excludes a square product by its least index. The classical criterion then gives the stated groups at every level. This is a proof sketch of the selected subfamily; the all-level result remains labelled as a preprint claim.

Inspect all 8 connections and exact references
Evidence for each connection
ConnectionStatement and source
1Critical orbit of x²+c → First two classes independentConstruction / input

Compute b₁=-c and b₂=c²+c and test that neither class nor their product is a square.

2First two classes independent ↔ Full Galois group at level twoEquivalence

The first two adjusted critical classes are independent exactly when the second-level Galois group is the full order-eight binary-tree group.

  • D1 · Stoll (1992)Theorem in §1, part 1(a) ⇔ 1(b); restated in Stoll 2026, Proposition 1.7The classical finite-level square-class equivalence; the inspected restatement is supplied separately.Primary source
  • D2 · Stoll (2026)Definition 1.2 and Proposition 1.7, pp. 2–3; arXiv:2611.14014v1Proposition 1.7 explicitly attributes the equivalence to Stoll 1992.Primary source
3First two classes independent → ANDConstruction / input

The initial independence check is combined with the stated parameter conditions.

4c > 0; s even; r ≡ 3 mod 4 → ANDConstruction / input

The congruences are imposed on the coprime positive numerator r and denominator s.

5AND → Characters separate every indexDeduction · preprint

For the stated positive parameter subfamily, the initial conditions and the congruences produce quadratic characters separating every adjusted critical value from all later values.

  • D3 · Stoll (2026)Lemma 4.3(C3), p. 8; Theorem 6.1(1), p. 11; arXiv:2611.14014v1The map selects the positive rational subfamily with even denominator and numerator congruent to three modulo four.Primary source
  • D4 · Stoll (2026)Definition 2.2 and Proposition 2.3, p. 5; proof of Theorem 6.1, p. 11; arXiv:2611.14014v1Separating characters are not assumed to arise from primitive prime divisors with odd valuation.Primary source
  • D6 · Stoll (2026)Lemma 3.1(1), p. 7; Proposition 5.1(Z1), pp. 9–10; arXiv:2611.14014v1The sign and valuation characters supply the initial characters used in the expanded proof sketch; Lemma 4.3 supplies the later ones.Primary source
6Characters separate every index ↔ All critical classes independentEquivalence

Characters taking value -1 at one index and +1 at all later indices exist for every index exactly when the critical square classes are independent.

  • D4 · Stoll (2026)Definition 2.2 and Proposition 2.3, p. 5; proof of Theorem 6.1, p. 11; arXiv:2611.14014v1Separating characters are not assumed to arise from primitive prime divisors with odd valuation.Primary source
7All critical classes independent ↔ Full binary-tree group at every levelEquivalence

Independence of the infinite family means independence of every finite prefix, hence maximality at every finite level.

  • D1 · Stoll (1992)Theorem in §1, part 1(a) ⇔ 1(b); restated in Stoll 2026, Proposition 1.7The classical finite-level square-class equivalence; the inspected restatement is supplied separately.Primary source
  • D2 · Stoll (2026)Definition 1.2 and Proposition 1.7, pp. 2–3; arXiv:2611.14014v1Proposition 1.7 explicitly attributes the equivalence to Stoll 1992.Primary source
8Full binary-tree group at every level → Every iterate is irreducibleDeduction

The full binary-tree group acts transitively on the roots of each iterate, so each iterate is irreducible over Q.

Sources and scope checked .

Primes in polynomial orbits

These groups also help study a recurrence un+1=f(un)u_{n+1}=f(u_n) with f∈Z[x]f\in\mathbb Z[x]. If a prime divides some nonzero umu_m, then, apart from finitely many early terms, a reduction of f∘nf^{\circ n} has a root modulo that prime. At unramified primes, Frobenius must therefore fix a root of f∘nf^{\circ n}.

Chebotarev turns the proportion of such group elements into a density bound for primes. If the proportion with a fixed point tends to zero as n→∞n\to\infty, then the primes dividing the orbit have density zero. Jones applies this method to several infinite families of integral quadratic polynomials.

References 1

Related topics

References

  1. The Galois Theory of Iterates and Composites of Polynomials

    Odoni, R. W. K. Proceedings of the London Mathematical Society (3), 51(3), 385–414, 1985.

    Read the source
  2. Galois representations from pre-image trees: an arboreal survey

    Jones, Rafe. Publications mathématiques de Besançon. Algèbre et théorie des nombres, 107–136, 2013.

    Read the source
  3. Galois groups over Q of some iterated polynomials

    Stoll, Michael. Archiv der Mathematik, 59, 239–244, 1992.

    Read the source
  4. Large arboreal Galois representations

    Kadets, Borys. Journal of Number Theory, 210, 416–430, 2020.

    Read the source
  5. When do all iterates of x²+a have maximal Galois group?

    Stoll, Michael. arXiv preprint, 2026.

    Read the source
  6. Arboreal Galois groups of postcritically finite quadratic polynomials: The strictly preperiodic case

    Benedetto, Robert L. and Ghioca, Dragos and Juul, Jamie and Tucker, Thomas J. Canadian Journal of Mathematics, 2026.

    Read the source
  7. Iterates of Generic Polynomials and Generic Rational Functions

    Juul, Jamie. Transactions of the American Mathematical Society, 371(2), 809–831, 2019.

    Read the source
  8. Dynamical Galois groups of trinomials and Odoni's conjecture

    Looper, Nicole R. Bulletin of the London Mathematical Society, 51(2), 278–292, 2019.

    Read the source
  9. Odoni's conjecture for number fields

    Benedetto, Robert L. and Juul, Jamie. Bulletin of the London Mathematical Society, 51(2), 237–250, 2019.

    Read the source
  10. Polynomials with Surjective Arboreal Galois Representations Exist in Every Degree

    Specter, Joel. arXiv preprint, 2018.

    Read the source
  11. Arboreal Galois groups of postcritically finite quadratic polynomials: The periodic case

    Benedetto, Robert L. and Ghioca, Dragos and Juul, Jamie and Tucker, Thomas J. Journal of the London Mathematical Society, 112(2), e70257, 2025.

    Read the source
  12. Examples of Quadratic Polynomials over Q with Surjective Arboreal Galois Representations

    Henderson, Luck and Juul, Jamie and Lattin, Brenner and Mercado, Enrique and Schaefer, Mia. arXiv preprint, 2026.

    Read the source
  13. The arithmetic of curves defined by iteration

    Hindes, Wade. Acta Arithmetica, 169(1), 1–27, 2015.

    Read the source
  14. The density of prime divisors in the arithmetic dynamics of quadratic polynomials

    Jones, Rafe. Journal of the London Mathematical Society, 78(2), 523–544, 2008.

    Read the source