An Inductive Schema for Computing Conjugacy Classes in Permutation Groups

DOI10.2307/2153415zbMATH Open0808.20007OpenAlexW2003239749MaRDI QIDQ4286607FDOQ4286607

Authors: Greg Butler 

Publication date: 22 March 1995

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

Recommendations

• scientific article; zbMATH DE number 1254012
• scientific article; zbMATH DE number 850191
• Computing the subgroups of a permutation group
• Computing conjugacy class representatives in permutation groups.
• Conjugacy classes in finite permutation groups via homomorphic images

zbMATH Keywords

Sylow subgroupsconjugacy classesimplementationefficient algorithmspermutation groupsconjugacy classes of \(p\)-groupsquotients of centralizers of \(p\)-elements

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Conjugacy class sums for induced modules: Construction and applications
• Computing character tables and Cartan matrices of finite monoids with fixed point counting
• Normalizers of \(p\)-subgroups in finite groups.
• Conjugacy classes in finite permutation groups via homomorphic images
• Computing conjugacy class representatives in permutation groups.

Uses Software

• Cayley

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286607)