English

Density of random subsets and applications to group theory

Group Theory 2025-08-26 v2 Probability

Abstract

Developing an idea of M. Gromov, we study the intersection formula for random subsets with density. The \textit{density} of a subset AA in a finite set EE is defined by densA:=logE(A)dens A := \log_{|E|}(|A|). The aim of this article is to give a precise meaning of Gromov's \textit{intersection formula}: "Random subsets" AA and BB of a finite set EE satisfy dens(AB)=densA+densB1dens (A\cap B) = dens A + dens B -1. As an application, we exhibit a phase transition phenomenon for random presentations of groups at density λ/2\lambda/2 for any 0<λ<10<\lambda<1, characterizing the C(λ)C'(\lambda)-small cancellation condition. We also improve an important result of random groups by G. Arzhantseva and A. Ol'shanskii from density 00 to density 0d<1120m2ln(2m)0\leq d<\frac{1}{120m^2\ln(2m)}.

Keywords

Cite

@article{arxiv.2104.09192,
  title  = {Density of random subsets and applications to group theory},
  author = {Tsung-Hsuan Tsai},
  journal= {arXiv preprint arXiv:2104.09192},
  year   = {2025}
}

Comments

version 2, 41 pages

R2 v1 2026-06-24T01:19:12.728Z