SearcharxivSearch

arXiv · 1208.1063

Iterated Monodromy Groups of Intermediate Growth

Abstract

We give two new examples of groups of intermediate growth, by a method that was first used by Bux and Pérez. Our examples are the groups generated by the automata with the kneading sequences 11(0) and 0(011). By results of Nekrashevych, both of these groups are iterated monodromy groups of complex post-critically finite quadratic polynomials. We include a complete, systematic description of the Bux-Pérez method. We also prove, as a sample application of the method, that the groups determined by the automata with kneading sequence 1(0^k) (k >= 2) have intermediate growth, although this result is implicit in a survey article by Bartholdi, Grigorchuk, and Sunik. The paper concludes with an example of a group with no admissible length function; i.e., the group in question admits no length function with the properties required by the Bux-Pérez method. Whether the group has intermediate growth appears to be an open question.

Explore related subjects

Keep this discovery

BibTeXRIS

Ashley S. Dougherty, Lydia R. Kindelin, Aaron M. Reaves, Andrew J. Walker, Nathaniel M. Zakahi. 2013-08-29. Iterated Monodromy Groups of Intermediate Growth. https://arxiv.org/abs/1208.1063

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