An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
From MaRDI portal
Publication:4286607
DOI10.2307/2153415zbMath0808.20007MaRDI QIDQ4286607
Publication date: 22 March 1995
Full work available at URL: https://doi.org/10.2307/2153415
conjugacy classes; permutation groups; Sylow subgroups; implementation; efficient algorithms; conjugacy classes of \(p\)-groups; quotients of centralizers of \(p\)-elements
68W30: Symbolic computation and algebraic computation
20-04: Software, source code, etc. for problems pertaining to group theory
20B35: Subgroups of symmetric groups
Related Items
Conjugacy classes in finite permutation groups via homomorphic images, Computing conjugacy class representatives in permutation groups.
Uses Software
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
