REVIEW
Cherlin's conjecture on finite primitive binary permutation groups
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Cherlin's conjecture on finite primitive binary permutation groups
classification
math.GR
math.LO
keywords
binarygrouppermutationcherlinconjecturefiniteorbitsprimitive
read the original abstract
A permutation group is {\it binary} if its orbits on $k$-tuples, for any integer $k\geq 2$, can be deduced from its orbits on $2$-tuples. Cherlin conjectured that a finite primitive binary permutation group $G$ must lie in one of three known families. In this paper we complete the proof of this conjecture. To do this we study the case where the group $G$ is almost simple of Lie type.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.