A bound on the rank of primitive solvable permutation groups (Q1113279): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0021-8693(88)90222-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1977518885 / rank | |||
Normal rank |
Revision as of 23:56, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A bound on the rank of primitive solvable permutation groups |
scientific article |
Statements
A bound on the rank of primitive solvable permutation groups (English)
0 references
1988
0 references
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}\).
0 references
solvable, primitive groups
0 references