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 profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2006206 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3216859064 / rank | |||
Normal rank | |||
| Property / title | |||
On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (English) | |||
| Property / title: On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (English) / rank | |||
Normal rank | |||
Revision as of 19:37, 19 March 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
