On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (Q3887632): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Implementation and Analysis of the Todd-Coxeter Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Defining relations for the Held-Higman-Thompson simple group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The multipliers of the simple groups of order 604,800 and 50, 232,960 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3895641 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4190797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ABSTRACT DEFINITIONS FOR THE MATHIEU GROUPS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A practical method for enumerating cosets of a finite abstract group / rank | |||
Normal rank |
Latest revision as of 09:23, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations |
scientific article |
Statements
1980
0 references
Schreier-Todd-Coxeter-Sims method
0 references
strong generating set
0 references
ordered base
0 references
orbits of a permutation group
0 references
coset representatives
0 references
presentations
0 references
On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (English)
0 references