The Primitive Soluble Permutation Groups of Degree Less Than 256

This monograph addresses the problem of describing all primitive soluble permutation groups of a given degree, with particular reference to those degrees less than 256. The theory is presented in detail and in a new way using modern terminology. A description is obtained for the primitive soluble permutation groups of prime-squared degree and a partial description obtained for prime-cubed degree. These descriptions are easily converted to algorithms for enumerating appropriate representatives of the groups. The descriptions for degrees 34 (die vier hochgestellt, Sonderzeichen) and 26 (die sechs hochgestellt, Sonderzeichen) are obtained partly by theory and partly by machine, using the software system Cayley. The material is appropriate for people interested in soluble groups who also have some familiarity with the basic techniques of representation theory. This work complements the substantial work already done on insoluble primitive permutation groups.