Conjugacy classes in finite permutation groups via homomorphic images

DOI10.1090/S0025-5718-99-01157-6zbMath0962.20001OpenAlexW2008912975WikidataQ123151116 ScholiaQ123151116MaRDI QIDQ4501044

Alexander Hulpke

Publication date: 3 September 2000

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

Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01157-6

zbMATH Keywords

algorithmsconjugacy classesfinite permutation groups

Mathematics Subject Classification ID

Related Items (8)

Conjugacy classes and centralisers in wreath products ⋮ Computing the number of the equivalence classes for reversible logic functions ⋮ THE CONJUGACY CLASSES OF A SUBGROUP $S_{n}^{m} : C_{m}$ OF S_mn, prime m ⋮ Computing conjugacy classes of elements in matrix groups. ⋮ The characteristic masses of Niemeier lattices ⋮ Computing Hall subgroups of finite groups ⋮ Computing conjugacy class representatives in permutation groups. ⋮ Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\)

Uses Software

• GAP

Cites Work

• Computing the composition factors of a permutation group in polynomial time
• Computing the order of a solvable permutation group
• Computing chief series, composition series and socles in large permutation groups
• Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
• On Transitive Permutation Groups
• An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conjugacy classes in finite permutation groups via homomorphic images