# A reduction theorem for primitive binary permutation groups

@inproceedings{Wiscons2016ART, title={A reduction theorem for primitive binary permutation groups}, author={Joshua Wiscons}, year={2016} }

- Published 2016
DOI:10.1112/blms/bdw005

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

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## Cherlin’s conjecture for sporadic simple groups

VIEW 2 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## On the relational complexity of a finite permutation group

VIEW 3 EXCERPTS

CITES RESULTS & BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-7 OF 7 REFERENCES

#### Similar Papers

Loading similar papers…