A reduction theorem for primitive binary permutation groups.

From MaRDI portal
Publication:2801723




Abstract: A permutation group (X,G) is said to be binary, or of relational complexity 2, if for all n, the orbits of G (acting diagonally) on X2 determine the orbits of G on Xn in the following sense: for all , and are G-conjugate if and only if every pair of entries from is G-conjugate to the corresponding pair from . Cherlin has conjectured that the only finite primitive binary permutation groups are Sn, groups of prime order, and affine orthogonal groups VtimesO(V) where V is a vector space equipped with an anisotropic quadratic form; recently he succeeded in establishing the conjecture for those groups with an abelian socle. In this note, we show that what remains of the conjecture reduces, via the O'Nan-Scott Theorem, to groups with a nonabelian simple socle.









This page was built for publication: A reduction theorem for primitive binary permutation groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2801723)