SearcharxivSearch

arXiv · 1402.0799

Transversals as generating sets in finitely generated groups

Abstract

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which contains a generating set of size $n$ for $G$, and that the construction is algorithmic when $G$ is finitely presented. We also show that, in the case where $G$ has rank $n \leq3$, there is a simultaneous left-right transversal for $H$ which contains a generating set of size $n$ for $G$. We finish by showing that if $H$ is a subgroup of a rank $n$ group $G$ with index less than $3 \cdot 2^{n-1}$, and $H$ contains no primitive elements of $G$, then $H$ is normal in $G$ and $G/H \cong C_{2}^{n}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Jack Button, Maurice Chiodo, Mariano Zeron-Medina Laris. 2014-02-04. Transversals as generating sets in finitely generated groups. https://doi.org/10.1017/s0004972715000982

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