{"paper":{"title":"A reduction theorem for primitive binary permutation groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.GR","authors_text":"Joshua Wiscons","submitted_at":"2015-06-12T21:53:25Z","abstract_excerpt":"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^2$ determine the orbits of $G$ on $X^n$ in the following sense: for all $\\bar{x},\\bar{y} \\in X^n$, $\\bar{x}$ and $\\bar{y}$ are $G$-conjugate if and only if every pair of entries from $\\bar{x}$ is $G$-conjugate to the corresponding pair from $\\bar{y}$. Cherlin has conjectured that the only finite primitive binary permutation groups are $S_n$, groups of prime order, and affine orthogonal groups $V\\rtimes O(V)$ where $V$ is a vector space equipped with an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04187","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}