pith. sign in

arxiv: 1304.3583 · v2 · pith:AFBQSRBKnew · submitted 2013-04-12 · 🧮 math.GR · math.CO

Collapse of random triangular groups: a closer look

classification 🧮 math.GR math.CO
keywords gammarandomepsilongroupsomeprobabilitytriangularasymptotic
0
0 comments X
read the original abstract

The random triangular group \Gamma(n,t) is a group given by a presentation P=<S|R>, 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.