Computing the soluble radical of a permutation group.

DOI10.1016/j.jalgebra.2006.02.027zbMath1100.20003OpenAlexW2075115191MaRDI QIDQ2496868

William R. Unger

Publication date: 20 July 2006

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2006.02.027

zbMATH Keywords

algorithmspermutation groupssoluble radicals\(p\)-cores

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Uses Software

• Magma
• ATLAS Group Representations

Cites Work

• Computing with group homomorphisms
• The Magma algebra system. I: The user language
• Computing Sylow subgroups in permutation groups
• Automorphism group computation and isomorphism testing in finite groups
• Constructing transitive permutation groups.
• Computing maximal subgroups of finite groups.
• On minimal faithful permutation representations of finite groups
• Computing the subgroups of a permutation group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the soluble radical of a permutation group.