Settled Elements in Arboreal Galois Groups of Quadratic PCF Polynomials
\"Ozlem Ejder, Dilber Kocak

TL;DR
This paper proves that for certain quadratic polynomials over fields, the associated arboreal Galois groups are densely settled, extending previous conjectures and applying to notable maps like the Basilica map.
Contribution
It establishes that arithmetic iterated monodromy groups of postcritically finite quadratic polynomials are densely settled, confirming a conjecture for a broad class of polynomials.
Findings
Densely settled groups are shown for quadratic polynomials with periodic postcritical orbits.
Results apply to the Basilica map, a well-known quadratic polynomial.
In number fields, infinitely many cases have densely settled arboreal Galois representations.
Abstract
Let be a quadratic polynomial where is a field of characteristic not equal to . The associated arboreal Galois representation of the absolute Galois group of acts on a regular rooted binary tree. Boston and Jones conjectured that, for , the image of this representation contains a dense set of settled elements. Roughly speaking, a cycle of an automorphism of the tree is called stable if its length strictly increases at each subsequent level, and is called settled if the proportion of vertices contained in stable cycles goes to as the level goes to infinity. In this article, we prove that the arithmetic iterated monodromy groups of postcritically finite quadratic polynomials in with periodic postcritical orbits are densely settled. In the number field case, by a result of Benedetto--Ghioca--Juul--Tucker…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
