The Solvable Primitive Permutation Groups of Degree at Most 6560

DOI10.1112/S146115700000036XzbMath1053.20001MaRDI QIDQ4827607

Burkhard Höfling, Bettina Eick

Publication date: 18 November 2004

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.lms.ac.uk/jcm/6/lms2002-003/

zbMATH Keywords

algorithms; conjugacy class representatives; solvable primitive permutation groups

Mathematics Subject Classification ID

20B15: Primitive groups

Related Items

Conjugacy of Subgroups of the General Linear Group, LINEAR GROUPS OF SMALL DEGREE OVER FINITE FIELDS, The affine primitive permutation groups of degree less than 1000., Constructing transitive permutation groups., The primitive permutation groups of degree less than 2500.

Uses Software

• MeatAxe

Cites Work

• Unnamed Item
• On the maximal subgroups of the finite classical groups
• Computing the order of a solvable permutation group
• The primitive soluble permutation groups of degree less than 256
• Computing subgroups invariant under a set of automorphisms
• Isomorphism testing for \(p\)-groups
• Computing matrix group decompositions with respect to a normal subgroup
• Zwei Klassen von Formationen endlicher auflösbarer Gruppen, deren Halbverband gesättigter Unterformationen genau ein maximales Element besitzt. (Two classes of formations of finite solvable groups the semilattice of saturated subformations of which has exactly one maximal element)
• The primitive permutation groups of degree less than 1000
• Treating the Exceptional Cases of the MeatAxe
• CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
• Some remarks on the computation of conjugacy classes of soluble groups