A bound on the rank of primitive solvable permutation groups (Q1113279): Difference between revisions

Huppert over thirty years ago characterized the solvable, double- transitive finite permutation groups. A little over a decade later Foulser generalized this result to solvable, primitive groups of low rank. The purpose of the paper under review is to give a further generalization to solvable, primitive groups of arbitrary rank. Roughly speaking, if \(G\leq Sym(n)\) is of the given type and of rank r then either it is of a known class or \(n\leq [(r+1.43)/2\sqrt{3}]^{36.435663}\).