SearcharxivSearch

arXiv · 1309.5804

Profinite iterated monodromy groups arising from quadratic morphisms with infinite postcritical orbits

Abstract

We study in detail the profinite group G arising as geometric étale iterated monodromy group of an arbitrary quadratic morphism f with an infinite postcritical orbit over a field of characteristic different from two. This is a self-similar closed subgroup of the group of automorphisms of a regular rooted binary tree. In many cases it is equal to the automorphism group of the tree, but there remain some interesting cases where it is not. In these cases we prove that the conjugacy class of G depends only on the combinatorial type of the postcritical orbit of f. We also determine the Hausdorff dimension and the normalizer of G. This result is then used to describe the arithmetic étale iterated monodromy group of f. The methods used mostly group theoretical and of the same type as in a previous article of the same author dealing with quadratic polynomials with a finite postcritical orbit. The results on abstract self-similar profinite groups acting on a regular rooted binary tree may be of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Richard Pink. 2013-09-23. Profinite iterated monodromy groups arising from quadratic morphisms with infinite postcritical orbits. https://arxiv.org/abs/1309.5804

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR