Computing the subgroups of a permutation group
Publication:5928886
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
algorithmsascending series of normal subgroupsconjugacy classes of subgroupsfinite permutation groupssubgroups of permutation groupstrivial Fitting groups
Symbolic computation and algebraic computation (68W30) Conjugacy classes for groups (20E45) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items (13)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 104
This page was built for publication: Computing the subgroups of a permutation group