SearcharxivSearch

arXiv · 1412.8741

A sharper threshold for random groups at density one-half

Abstract

In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of the number of relators compared to the length of relators, then many group-theoretic properties become generically true or generically false at different values of d. The signature theorem for this density model is a phase transition from triviality to hyperbolicity: for d < 1/2, random groups are a.a.s. infinite hyperbolic, while for d > 1/2, random groups are a.a.s. order one or two. We study random groups at the density threshold d = 1/2. Kozma had found that trivial groups are generic for a range of growth rates at d = 1/2; we show that infinite hyperbolic groups are generic in a different range. (We include an exposition of Kozma's previously unpublished argument, with slightly improved results, for completeness.)

Explore related subjects

Keep this discovery

BibTeXRIS

Moon Duchin, Kasia Jankiewicz, Shelby C. Kilmer, Samuel Lelièvre, John M. Mackay, Andrew P. Sánchez. 2014-12-30. A sharper threshold for random groups at density one-half. https://arxiv.org/abs/1412.8741

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