Collapse of random triangular groups: a closer look.
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(8)- Percolation on hyperbolic graphs
- On simple connectivity of random 2-complexes
- A sharp threshold for collapse of the random triangular group
- On topological minors in random simplicial complexes
- Random triangular groups.
- Non‐orderability of random triangular groups by using random 3CNF formulas
- Random triangular groups at density \(1/3\).
- Vertex numbers of simplicial complexes with free abelian fundamental group
This page was built for publication: Collapse of random triangular groups: a closer look.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495346)