SearcharxivSearch

arXiv · math/0604343

Random quotients of the modular group are rigid and essentially incompressible

Abstract

We show that for any positive integer $m\ge 1$, $m$-relator quotients of the modular group $M = PSL(2,\mathbb{Z})$ generically satisfy a very strong Mostow-type \emph{isomorphism rigidity}. We also prove that such quotients are generically "essentially incompressible". By this we mean that their "absolute $T$-invariant", measuring the smallest size of any possible finite presentation of the group, is bounded below by a function which is almost linear in terms of the length of the given presentation. We compute the precise asymptotics of the number $I_m(n)$ of \emph{isomorphism types} of $m$-relator quotients of $M$ where all the defining relators are cyclically reduced words of length $n$ in $M$. We obtain other algebraic results and show that such quotients are complete, Hopfian, co-Hopfian, one-ended, word-hyperbolic groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilya Kapovich, Paul Schupp. 2006-04-14. Random quotients of the modular group are rigid and essentially incompressible. https://doi.org/10.1515/crelle.2009.019

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