Density of random subsets and applications to group theory (Q2102169): Difference between revisions

Summary: Developing an idea of \textit{M. Gromov} [Geometric group theory. Volume 2: Asymptotic invariants of infinite groups. Proceedings of the symposium held at the Sussex University, Brighton, July 14-19, 1991. Cambridge: Cambridge University Press (1993; Zbl 0841.20039)], we study the intersection formula for random subsets with density. The density of a subset \(A\) in a finite set \(E\) is defined by \(\operatorname{dens} A : = \log_{{\mid} E {\mid}} ({\mid} A{\mid})\). The aim of this article is to give a precise meaning of Gromov's \textit{intersection formula}: ``Random subsets'' \( A\) and \(B\) of a finite set \(E\) satisfy \(\operatorname{dens} (A \cap B) = \operatorname{dens} A + \operatorname{dens} B - 1\). As an application, we exhibit a phase transition phenomenon for random presentations of groups at density \(\lambda {/} 2 \lambda /2\) for any \(0 < \lambda < 10<\lambda <1\), characterizing the \(C^\prime (\lambda)\)-small cancellation condition. We also improve an important result of random groups by \textit{G. N. Arzhantseva} and \textit{A. Yu. Ol'shanskij} [Math. Notes 59, No. 4, 350--355 (1996; Zbl 0877.20021); translation from Mat. Zametki 59, No. 4, 489--496 (1996)] from density \(0\) to density \(0 \leq d < 1 {/} (120 m^2 \ln (2 m))\).