SearcharxivSearch

arXiv · 1304.3583

Collapse of random triangular groups: a closer look

Abstract

The random triangular group \Gamma(n,t) is a group given by a presentation P= , where S is a set of n generators and R is a random set of t cyclically reduced words of length three. The asymptotic behavior of \Gamma(n,t) is in some respects similar to that of widely studied density random group introduced by Gromov. In particular, it is known that if t <= n^{3/2-\epsilon} for some \epsilon > 0, then with probability 1-o(1) \Gamma(n,t) is infinite and hyperbolic, while for t >= n^{3/2+\epsilon}, with probability 1-o(1) it is trivial. In this note we show that \Gamma(n,t) collapses provided only that t <= C n^{3/2} for some constant C>0.

Explore related subjects

Keep this discovery

BibTeXRIS

Sylwia Antoniuk, Tomasz Łuczak, Jacek Świcatkowski. 2013-04-12. Collapse of random triangular groups: a closer look. https://doi.org/10.1112/blms%2Fbdu034

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