Search arXivSearch

arXiv · 1908.02365

Quasi-Isometric Bounded Generation by ${\mathbb Q}$-Rank-One Subgroups

Abstract

We say that a subset $X$ quasi-isometrically boundedly generates a finitely generated group $\Gamma$ if each element $\gamma$ of a finite-index subgroup of $\Gamma$ can be written as a product $\gamma = x_1 x_2 \cdots x_r$ of a bounded number of elements of $X$, such that the word length of each $x_i$ is bounded by a constant times the word length of $\gamma$. A. Lubotzky, S. Mozes, and M.S. Raghunathan observed in 1993 that ${\rm SL}(n,{\mathbb Z})$ is quasi-isometrically boundedly generated by the elements of its natural ${\rm SL}(2,{\mathbb Z})$ subgroups. We generalize (a slightly weakened version of) this by showing that every $S$-arithmetic subgroup of an isotropic, almost-simple ${\mathbb Q}$-group is quasi-isometrically boundedly generated by standard ${\mathbb Q}$-rank-1 subgroups.

Explore related subjects

Keep this discovery

BibTeXRIS

Dave Witte Morris. 2019-08-06. Quasi-Isometric Bounded Generation by ${\mathbb Q}$-Rank-One Subgroups. https://doi.org/10.3842/sigma.2020.012

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