Statistical properties of finitely presented groups (Q1910397)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Statistical properties of finitely presented groups
scientific article

    Statements

    Statistical properties of finitely presented groups (English)
    0 references
    8 September 1996
    0 references
    Let \(L_m\) be the free group on \(m\) generators \(e_1,\dots,e_m\) and let (P) be a property of the presentations of the groups obtained by adjoining two relators to \(L_m\). For every pair of nonnegative integers \(n_1\) and \(n_2\), let \(p_{n_1,n_2}\) be the proportion of pairs \(r_1\), \(r_2\) of cyclically reduced words in \(L_m\) of length \(n_1\) and \(n_2\), respectively, such that the presentation \(\langle e_1,\dots,e_m\mid r_1,r_2\rangle\) satisfies property (P). Then property (P) is said to hold asymptotically almost surely if \(p_{n_1,n_2}\) converges to 1 when \(\text{inf}\{n_1,n_2\}\) tends to infinity. The main result of this paper is the following Theorem: The presentations of groups with \(m\) generators and 2 relators are asymptotically almost surely word-hyperbolic groups of cohomological dimension 2, with boundary a Menger curve. The paper contains other (weaker) genericity results which hold for groups with a fixed arbitrary number of relators and the author claims that the theorem stated above is probably true for an arbitrary fixed number of relators. The proofs given in this paper rely on ideas and techniques that are sketched in \textit{M. Gromov}'s paper [Publ., Math. Sci. Res. Inst. 8, 75-263 (1987; Zbl 0634.20015)], which contains statements of results of the same sort. Results in the same direction have also been proved independently by \textit{A. Yu. Ol'shanskij}. A lot of other results, remarks and conjectures on generic properties of finitely presented groups are contained in chapter 9 of \textit{M. Gromov}'s work ``Asymptotic invariants of infinite groups'' [Lond. Math. Soc. Lect. Note Ser. 182 (1993; Zbl 0841.20039)]. The paper under review contains detailed proofs and a thorough introduction to combinatorial group theory, which includes the study of diagrams, small cancellation theory, Dehn's algorithm, Dehn functions and the combinatorial Besicovich inequality.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    generators
    0 references
    presentations
    0 references
    relators
    0 references
    cyclically reduced words
    0 references
    asymptotically almost surely word-hyperbolic groups
    0 references
    cohomological dimension 2
    0 references
    genericity
    0 references
    finitely presented groups
    0 references
    diagrams
    0 references
    small cancellation theory
    0 references
    Dehn's algorithm
    0 references
    Dehn functions
    0 references
    combinatorial Besicovich inequality
    0 references
    0 references