The class of groups all of whose subgroups with lesser number of generators are free is generic (Q1358513): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FREE INVERSE MONOIDS AND GRAPH IMMERSIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / rank
 
Normal rank

Latest revision as of 16:10, 27 May 2024

scientific article
Language Label Description Also known as
English
The class of groups all of whose subgroups with lesser number of generators are free is generic
scientific article

    Statements

    The class of groups all of whose subgroups with lesser number of generators are free is generic (English)
    0 references
    14 July 1997
    0 references
    The authors show that in a certain statistical sense, in almost every group with \(m\) generators and \(n\) relations, any subgroup generated by less than \(m\) elements is free. Let \(N_{m,n,t}\) be the number of all presentations of groups of the form \(G=\langle x_1,\dots,x_m\mid r_1=1,\dots,r_n=1\rangle\), where \(m>1\) and length \(|r_i|\leq t\) for each cyclically reduced word \(r_i\), \(N_{m,n,t}^f\) be the number of presentations such that any \((m-1)\)-generated subgroup of \(G\) is free. It is proved that there is a number \(c>0\) such that \(N_{m,n,t}^f/N_{m,n,t}\) is greater than \(1-\exp(-ct)\). Let \(N_d\) be the number of all presentations of groups considered such that \(|r_1|+\dots+|r_n|=d\), \(N^f_d\) be the number of such presentations for which any \((m-1)\)-generated subgroup of \(G\) is free. The authors also show that \(\lim_{d\to\infty}(N_d^f/N_d)=1\).
    0 references
    free subgroups
    0 references
    generators
    0 references
    relations
    0 references
    presentations
    0 references
    numbers of presentations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references