Computing Sylow subgroups of permutation groups using homomorphic images of centralizers

DOI10.1016/S0747-7171(08)80097-1zbMath0787.20004OpenAlexW1990638622WikidataQ122695094 ScholiaQ122695094MaRDI QIDQ1192227

Gregory Butler, John J. Cannon

Publication date: 27 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80097-1

zbMATH Keywords

performancealgorithmsorbitscentralizerpermutation grouphomomorphic imagescomputational group theorycentreset of generators\(p\)-Sylow subgroup

Mathematics Subject Classification ID

Related Items (1)

An Inductive Schema for Computing Conjugacy Classes in Permutation Groups

Uses Software

• Cayley

Cites Work

• 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)\)
• Computing the order of a solvable permutation group
• Effective computation with group homomorphisms
• The mechanical computation of first and second cohomology groups
• Constructing normalisers in finite soluble groups
• Computing in permutation and matrix groups. III: Sylow subgroups
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups

This page was built for publication: Computing Sylow subgroups of permutation groups using homomorphic images of centralizers