A reduction theorem for primitive binary permutation groups

@inproceedings{Wiscons2016ART,
  title={A reduction theorem for primitive binary permutation groups},
  author={Joshua Wiscons},
  year={2016}
}
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 X determine the orbits of G on X in the following sense: for all x̄, ȳ ∈ X, x̄ and ȳ are G-conjugate if and only if every pair of entries from x̄ 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 V ⋊ O(V ) where V is a vector… CONTINUE READING