SearcharxivSearch

arXiv · 2311.14022

Invariable generation of certain branch groups

Abstract

Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key examples of branch groups. In particular, we prove that all generating sets of the torsion Grigorchuk groups, of the branch Grigorchuk-Gupta-Sidki groups and of the torsion multi-EGS groups (which are natural generalisations of the Grigorchuk-Gupta-Sidki groups) are invariable generating sets. Furthermore, for the first Grigorchuk group and the torsion Grigorchuk-Gupta-Sidki groups, every finitely generated subgroup has a finite invariable generating set. Our results apply to finitely generated groups in $\mathcal{MN}$, the class of groups whose maximal subgroups are all normal. We then obtain that any $2$-generated group in $\mathcal{MN}$ is almost $\frac{3}{2}$-generated, and end by applying this observation to generating graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Charles Garnet Cox, Anitha Thillaisundaram. 2023-11-23. Invariable generation of certain branch groups. https://arxiv.org/abs/2311.14022

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