Constructing transitive permutation groups. (Q2456530)

This paper describes a method of constructing a complete, nonredundant list of the transitive permutation groups of a given degree \(n\) classified up to conjugacy in the symmetric group \(S_n\). The paper is based on the author's 1996 dissertation [Aachen: RWTH (1996; Zbl 0955.20002)]. Previous to Hulpke's work the transitive groups had been classified up to degree \(15\) using ad hoc arguments, and Hulpke has used his method to extend this classification up to degree \(30\) (including 25000 transitive groups of degree \(24\)). The full list is available in electronic form as libraries in the computer algebra systems GAP and MAGMA (the present paper includes a list of the non-regular minimally transitive groups of degree \(\leq 30\)). In enumerating the transitive groups of degree \(n\) there are two main steps: (i) constructing a list containing at least one representative of each \(S_n\)-conjugacy class of transitive subgroups of \(S_n\), and (ii) eliminating duplicate representatives of these classes. The first step is carried out recursively using the (known) primitive groups of degree dividing \(n\), and the second (computationally more intensive) step uses a series of increasingly complex criteria to distinguish between pairs of nonconjugate transitive subgroups of \(S_n\). In compiling the list the author has used a variety of additional checks to ensure, as far as possible, that it is complete and nonredundant. He notes that, in view of the number of groups involved, an attempt to extend the classification to degree \(32\) required more computational resources than he had available.