Computing in permutation and matrix groups. III: Sylow subgroups
DOI10.1016/S0747-7171(89)80068-9zbMath0677.20001OpenAlexW1963649181MaRDI QIDQ1123257
Gregory Butler, John J. Cannon
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80068-9
algorithmspermutation groupscentralizersbacktrack searchcyclic extensionsCAYLEYcomputing Sylow p-subgroups
Symbolic computation and algebraic computation (68W30) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Series and lattices of subgroups (20D30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Subgroups of symmetric groups (20B35) General theory for finite permutation groups (20B05)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A computer program for the calculation of a covering group of a finite group
- An interpretation of the cohomology groups \(H^ n(G,M)\)
- The mechanical computation of first and second cohomology groups
- Intersecting subgroups of finite soluble groups
- The computation of normalizers in permutation groups
- Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
- Computing in Permutation and Matrix Groups II: Backtrack Algorithm
- Computing normalizers in permutation groups
- Polynomial-time algorithms for finding elements of prime order and sylow subgroups
- Polynomial-time versions of Sylow's theorem
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- Implementation and Analysis of the Todd-Coxeter Algorithm
This page was built for publication: Computing in permutation and matrix groups. III: Sylow subgroups
