SearcharxivSearch

arXiv · 2109.12503

Maximal subgroups of a family of iterated monodromy groups

Abstract

The Basilica group is a well-known 2-generated weakly branch, but not branch, group acting on the binary rooted tree. Recently a more general form of the Basilica group has been investigated by Petschick and Rajeev, which is an $s$-generated weakly branch, but not branch, group that acts on the $m$-adic tree, for $s,m > 1$. A larger family of groups, which contains these generalised Basilica groups, is the family of iterated monodromy groups. With the new developments by Francoeur, the study of the existence of maximal subgroups of infinite index has been extended from branch groups to weakly branch groups. Here we show that a subfamily of iterated monodromy groups, which more closely resemble the generalised Basilica groups, have maximal subgroups only of finite index.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karthika Rajeev, Anitha Thillaisundaram. 2021-09-26. Maximal subgroups of a family of iterated monodromy groups. https://doi.org/10.1017/s0017089524000120

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