The rank of a finite primitive solvable permutation group (Q1084491)

The author deals with finite primitive solvable permutation groups G. Such a group G has prime power degree \(d=p^ n\). The rank r of G is by definition the number of orbits of a point stabilizer on the point set. It is shown that d is bounded by a function of r, if G is not permutation isomorphic to a subgroup of the semilinear group of the Galois field of \(p^ n\) elements. Of course, the results are obtained by studying certain linear groups. The proof depends heavily on the analysis of maximal solvable primitive linear groups given by \textit{D. A. Suprunenko} [Matrix groups (Russian; 1972; Zbl 0253.20074; translation 1976; Zbl 0317.20028)] and on results due to \textit{D. A. Foulser} [Trans. Am. Math. Soc. 143, 1-54 (1969; Zbl 0187.29401)].