On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (Q3887632)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3693510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations |
scientific article; zbMATH DE number 3693510 |
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
