SearcharxivSearch

arXiv · 2210.08234

Phase transition for the existence of van Kampen 2-complexes in random groups

Abstract

Gromov showed that (1993) with high probability, every bounded and reduced van Kampen diagram $D$ of a random group at density $d$ satisfies the isoperimetric inequality $|\partial D|\geq (1-2d-s)|D|\ell$. In this article, we adapt Gruber-Mackay's prove for random triangular groups, showing a non-reduced 2-complex version of this inequality. Moreover, for any 2-complex $Y$ of a given geometric form, we exhibit a phase transition: we give explicitly a critical density $d_c$ depending only on $Y$ such that, in a random group at density $d$, if $d d_c$ then there exists reduced van Kampen 2-complexes of the form $Y$. As an application, we show a phase transition for the $C(p)$ small-cancellation condition: for a random group at density $d$, if $d<1/(p+1)$ then it satisfies $C(p)$; while if $d>1/(p+1)$ then it does not satisfy $C(p)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Tsung-Hsuan Tsai. 2022-10-15. Phase transition for the existence of van Kampen 2-complexes in random groups. https://doi.org/10.2140/agt.2024.24.3897

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