Computing chief series, composition series and socles in large permutation groups

DOI10.1006/jsco.1997.0127zbMath0890.20006OpenAlexW1995566841MaRDI QIDQ1369791

Derek F. Holt, John J. Cannon

Publication date: 25 November 1997

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

Full work available at URL: https://semanticscholar.org/paper/7bbab3786ffd42b76a9abe537da3ffe72942fcf0

zbMATH Keywords

algorithmsprimitive permutation groupssoclescomposition factorschief series

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Subgroups of symmetric groups (20B35)

Related Items

Towards Efficient Normalizers of Primitive Groups ⋮ Involutions and characters of upper triangular matrix groups ⋮ Automorphism group computation and isomorphism testing in finite groups ⋮ The product replacement algorithm and Kazhdan’s property (T) ⋮ On standardized models of isogenous elliptic curves ⋮ The groups of order at most 2000 ⋮ Construction of the irreducible modular representations of a finite group ⋮ Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field ⋮ Conjugacy classes in finite permutation groups via homomorphic images