Computing the subgroups of a permutation group

DOI10.1006/jsco.2000.1012zbMath0984.20002OpenAlexW2084428610MaRDI QIDQ5928886

Derek F. Holt, John J. Cannon, Bruce C. Cox

Publication date: 29 January 2002

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

Full work available at URL: https://doi.org/10.1006/jsco.2000.1012

zbMATH Keywords

algorithmsascending series of normal subgroupsconjugacy classes of subgroupsfinite permutation groupssubgroups of permutation groupstrivial Fitting groups

Mathematics Subject Classification ID

Related Items (13)

Congruence Subgroups of PSL(2, Z) of Genus Less than or Equal to 24 ⋮ Computing maximal subgroups of finite groups. ⋮ Automorphism group computation and isomorphism testing in finite groups ⋮ Computing conjugacy classes of elements in matrix groups. ⋮ Constructing transitive permutation groups. ⋮ Computing subgroups of bounded index in a finite group. ⋮ The use of permutation representations in structural computations in large finite matrix groups ⋮ Computing Hall subgroups of finite groups ⋮ Computing the soluble radical of a permutation group. ⋮ Construction of the irreducible modular representations of a finite group ⋮ A local–global principle in the dynamics of quadratic polynomials ⋮ Computing the table of marks of a cyclic extension ⋮ The perfect groups of order up to two million

Uses Software

• Magma

Cites Work

• Construction of defining relators for finite groups
• Studies of the lattice of subgroups of finite groups using a programmable electronic dual machine
• Fundamental algorithms for permutation groups
• The Magma algebra system. I: The user language
• On minimal faithful permutation representations of finite groups
• Perfect groups of order less than 10⁴
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the subgroups of a permutation group