Sur une majoration du nombre de groupes définis par générateurs et ayant une seule relation. (An upper bound for the number of groups defined by generators and only one relator) (Q1096021): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On free products with amalgamation of two infinite cyclic groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071794 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4145882 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On free groups and their automorphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3041265 / rank | |||
Normal rank |
Revision as of 13:44, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sur une majoration du nombre de groupes définis par générateurs et ayant une seule relation. (An upper bound for the number of groups defined by generators and only one relator) |
scientific article |
Statements
Sur une majoration du nombre de groupes définis par générateurs et ayant une seule relation. (An upper bound for the number of groups defined by generators and only one relator) (English)
0 references
1987
0 references
Relators in a free monoid are counted here by counting the number of equivalence classes r of words of given lengths where \(r\in C/{\mathcal R}\) such that C equals the set of all cyclically reduced words and \({\mathcal R}\) is defined by: u\({\mathcal R}v\) if and only if u and v or u and \(\bar v\) are conjugates. Here \(\bar v\) denotes a formal inverse of v. The result is then applied to one-relator groups.
0 references
free monoid
0 references
words
0 references
cyclically reduced words
0 references
one-relator groups
0 references