An Inductive Schema for Computing Conjugacy Classes in Permutation Groups

DOI10.2307/2153415zbMath0808.20007OpenAlexW2003239749MaRDI QIDQ4286607

Greg Butler

Publication date: 22 March 1995

Full work available at URL: https://doi.org/10.2307/2153415

zbMATH Keywords

conjugacy classespermutation groupsSylow subgroupsimplementationefficient algorithmsconjugacy classes of \(p\)-groupsquotients of centralizers of \(p\)-elements

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04) Subgroups of symmetric groups (20B35)

Related Items (2)

Computing conjugacy class representatives in permutation groups. ⋮ Conjugacy classes in finite permutation groups via homomorphic images

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the order of a solvable permutation group
• Computing intersections and normalizers in soluble groups
• A proof of Holt's algorithm
• Effective computation with group homomorphisms
• Constructing normalisers in finite soluble groups
• Group-theoretic algorithms and graph isomorphism
• Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
• The computation of normalizers in permutation groups
• On Holt's algorithm
• Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
• Computing normalizers in permutation groups
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Some remarks on the computation of conjugacy classes of soluble groups
• Endliche Gruppen I

This page was built for publication: An Inductive Schema for Computing Conjugacy Classes in Permutation Groups