Computing in permutation and matrix groups. III: Sylow subgroups
From MaRDI portal
algorithmscentralizerspermutation groupscyclic extensionsCAYLEYbacktrack searchcomputing Sylow p-subgroups
Symbolic computation and algebraic computation (68W30) General theory for finite permutation groups (20B05) Subgroups of symmetric groups (20B35) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Generators, relations, and presentations of groups (20F05) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)
Recommendations
Cites work
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3865540 (Why is no real title available?)
- scientific article; zbMATH DE number 3871623 (Why is no real title available?)
- scientific article; zbMATH DE number 3922932 (Why is no real title available?)
- scientific article; zbMATH DE number 3702903 (Why is no real title available?)
- scientific article; zbMATH DE number 3204712 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3399470 (Why is no real title available?)
- scientific article; zbMATH DE number 3399496 (Why is no real title available?)
- A computer program for the calculation of a covering group of a finite group
- An interpretation of the cohomology groups \(H^ n(G,M)\)
- 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
- Implementation and Analysis of the Todd-Coxeter Algorithm
- Intersecting subgroups of finite soluble groups
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- Polynomial-time algorithms for finding elements of prime order and sylow subgroups
- Polynomial-time versions of Sylow's theorem
- The computation of normalizers in permutation groups
- The mechanical computation of first and second cohomology groups
Cited in
(15)- scientific article; zbMATH DE number 3871627 (Why is no real title available?)
- scientific article; zbMATH DE number 4134288 (Why is no real title available?)
- A proof of Holt's algorithm
- On Holt's algorithm
- Effective computation with group homomorphisms
- scientific article; zbMATH DE number 4136201 (Why is no real title available?)
- Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
- scientific article; zbMATH DE number 3863443 (Why is no real title available?)
- Computing normalizers in permutation groups
- scientific article; zbMATH DE number 3991751 (Why is no real title available?)
- Generation of finite groups with cyclic Sylow subgroups
- Algorithm for calculation in Sylow 2-subgroups of alternating groups using the computer algebra system GAP
- Search algorithm of the number of unfixed points of permutations from Sylow 2-subgroups \(Syl_2(S_{2^n})\) of symmetric groups \(S_{2^n}\).
- An algorithm for the Thompson subgroup of a \(p\)-group.
- The computation of normalizers in permutation groups
This page was built for publication: Computing in permutation and matrix groups. III: Sylow subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123257)
