Computing the subgroups of a permutation group

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

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

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

algorithms; ascending series of normal subgroups; conjugacy classes of subgroups; finite permutation groups; subgroups of permutation groups; trivial Fitting groups

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20E45: Conjugacy classes for groups

20D30: Series and lattices of subgroups

20-04: Software, source code, etc. for problems pertaining to group theory

Related Items

Congruence Subgroups of PSL(2, Z) of Genus Less than or Equal to 24, Automorphism group computation and isomorphism testing in finite groups, Constructing transitive permutation groups., Computing subgroups of bounded index in a finite group., Computing the soluble radical of a permutation group., Computing maximal subgroups of finite groups.

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