SearcharxivSearch

arXiv · 2302.06255

On super-rigidity of Gromov's random monster group

Abstract

In this article, we show super-rigidity of Gromov's random monster group. We prove that any morphism $\phi_\alpha$ from Gromov's random monster group $\Gamma_\alpha$ to the group $G$ has finite image for almost all $\alpha$, where $G$ is any of the following types of groups: mapping class group $MCG(S_{g,b})$, braid group $B_n$, outer automorphism group of a free group $Out(F_N)$, automorphism group of a free group $Aut(F_N)$, hierarchically hyperbolic group, a-$L^p$-menable group or K-amenable group. We introduce another property called hereditary super-rigidity and prove that $\Gamma_\alpha$ has hereditary super-rigidity with respect to an a-$L^p$-menable group or a K-amenable group. We also establish a stability theorem for the groups with respect to which $\Gamma_\alpha$ has super-rigidity and hereditary super-rigidity.

Explore related subjects

Keep this discovery

BibTeXRIS

Kajal Das. 2023-02-13. On super-rigidity of Gromov's random monster group. https://doi.org/10.1007/s10711-024-00950-y

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