An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
From MaRDI portal
Publication:4286607
Recommendations
Cites work
- scientific article; zbMATH DE number 3871623 (Why is no real title available?)
- scientific article; zbMATH DE number 3674346 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- A proof of Holt's algorithm
- Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
- Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
- Computing intersections and normalizers in soluble groups
- Computing normalizers in permutation groups
- Computing the order of a solvable permutation group
- Constructing normalisers in finite soluble groups
- Effective computation with group homomorphisms
- Endliche Gruppen I
- Group-theoretic algorithms and graph isomorphism
- On Holt's algorithm
- 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
- The computation of normalizers in permutation groups
Cited in
(5)- Conjugacy classes in finite permutation groups via homomorphic images
- Computing character tables and Cartan matrices of finite monoids with fixed point counting
- Normalizers of \(p\)-subgroups in finite groups.
- Conjugacy class sums for induced modules: Construction and applications
- Computing conjugacy class representatives in permutation groups.
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)