Finding composition factors of permutation groups of degree \(n\leq 10^ 6\)

DOI10.1016/S0747-7171(08)80101-0zbMath0792.20003OpenAlexW2075165982MaRDI QIDQ1192231

William M. Kantor

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80101-0

zbMATH Keywords

algorithmscomposition factorssimplicitycomposition seriesgenerating set

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Series and lattices of subgroups (20D30) Derived series, central series, and generalizations for groups (20F14)

Related Items (1)

Fast recognition of doubly transitive groups

Uses Software

• Cayley

Cites Work

• Computing the composition factors of a permutation group in polynomial time
• Subgroups of prime power index in a simple group
• Sylow's theorem in polynomial time
• The Rank 3 Permutation Representations of the Finite Classical Groups
• Finite Permutation Groups and Finite Simple Groups
• Maximal subgroups of finite groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding composition factors of permutation groups of degree \(n\leq 10^ 6\)