The classification of almost simple $\tfrac{3}{2}$-transitive groups
John Bamberg, Michael Giudici, Martin W. Liebeck, Cheryl E. Praeger, and Jan Saxl

TL;DR
This paper classifies finite 3/2-transitive permutation groups, showing they are either affine or almost simple, and provides a detailed classification of the almost simple case, including an arithmetic analysis of groups of Lie type.
Contribution
It proves that all 3/2-transitive groups are either affine or almost simple and classifies the almost simple groups, advancing understanding of their structure.
Findings
3/2-transitive groups are either affine or almost simple
Almost simple 3/2-transitive groups are classified
Primitive groups of Lie type have subdegrees divisible by p, with specific exceptions
Abstract
A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less obvious ones. We prove that 3/2-transitive groups are either affine or almost simple, and classify the latter. One of the main steps in the proof is an arithmetic result on the subdegrees of groups of Lie type in characteristic : with some explicitly listed exceptions, every primitive action of such a group is either 2-transitive, or has a subdegree divisible by .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Advanced Algebra and Geometry
