SearcharxivSearch

arXiv · 2602.02183

Random Groups at Density $d<1/2$: Sharp Length Inequalities for Generalized Torsion and a Fixed-width Exclusion via First-order Transfer

Abstract

Let $G$ be a random group in Gromov's density model $G(m,d,L)$ with $d<\tfrac12$. We prove a sharp quantitative constraint on products of conjugates equal to the identity: for every $n\ge1$ and $\varepsilon>0$, with overwhelming probability as $L\to\infty$, any tight word \[ W=\prod_{i=1}^n h_i^{-1} g h_i =1 \quad\text{in } G \] (with $g\neq 1$ as a word) satisfies the inequality \[ \sum_{i=1}^n \len{h_i} \;>\; \frac{1-2d-\varepsilon}{2}\,L \;-\; \frac{n}{2}\,\len{g}. \] The proof is a short van Kampen diagram argument: Ollivier's sharp isoperimetric inequality forces a 2-cell contributing a large portion of its boundary to the outer boundary, and a simple boundary block-counting estimate yields this corridor-type lower bound. As consequences we obtain uniform short-witness exclusions and width--length tradeoffs for generalized torsion at every density $d<\tfrac12$. We also deduce that random groups have no generalized torsion of any fixed width as a corollary of the recent first-order transfer theorem of Kharlampovich, Miasnikov, and Sklinos.

Explore related subjects

Keep this discovery

BibTeXRIS

Hyungryul Baik. 2026-02-02. Random Groups at Density $d<1/2$: Sharp Length Inequalities for Generalized Torsion and a Fixed-width Exclusion via First-order Transfer. https://arxiv.org/abs/2602.02183

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