The primitive soluble permutation groups of degree less than 256

DOI10.1017/S0004972700029786zbMath0718.20002OpenAlexW4299640234MaRDI QIDQ5749454

Mark W. Short

Publication date: 1991

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700029786

zbMATH Keywords

soluble quotient algorithmsoluble primitive permutation groupsmaximal soluble subgroups of general linear groups

Mathematics Subject Classification ID

Related Items (4)

The affine primitive permutation groups of degree less than 1000. ⋮ An algorithm for constructing representations of finite groups. ⋮ The primitive permutation groups of degree less than 2500. ⋮ The finite irreducible monomial linear groups of degree \(4\)

Cites Work

• The primitive permutation groups of degree less than 1000
• Unnamed Item

This page was built for publication: The primitive soluble permutation groups of degree less than 256