A strong generating test and short presentations for permutation groups (Q1192229): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Construction of defining relators for finite groups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3333220 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3832741 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A compact representation for permutation groups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5617749 / rank | |||
Normal rank | |||
Latest revision as of 11:30, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strong generating test and short presentations for permutation groups |
scientific article |
Statements
A strong generating test and short presentations for permutation groups (English)
0 references
27 September 1992
0 references
group membership problem
0 references
permutation groups
0 references
computational group theory
0 references
set of generators
0 references
strong generating set
0 references
algorithms
0 references
0 references
0 references
