Settled Elements in Arboreal Galois Groups of Quadratic PCF Polynomials

Abstract

Let f(x) ∈ K(x) be a quadratic polynomial where K is a field of characteristic not equal to 2. The associated arboreal Galois representation of the absolute Galois group of K acts on a regular rooted binary tree. Boston and Jones conjectured that, for f ∈ Z[x], 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 1 as the level goes to infinity. In this article, we prove that the arithmetic iterated monodromy groups of postcritically finite quadratic polynomials in K[x] with periodic postcritical orbits are densely settled. In the number field case, by a result of Benedetto--Ghioca--Juul--Tucker BGJT2025s, it follows that for infinitely many a ∈ K, the associated arboreal Galois representations are densely settled. In particular, our results apply to the arithmetic IMG of the Basilica map f(x)=x2-1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…