A reduction theorem for primitive binary permutation groups.

DOI10.1112/BLMS/BDW005zbMATH Open1350.20002arXiv1506.04187OpenAlexW3101427689MaRDI QIDQ2801723FDOQ2801723

Authors: Joshua Wiscons 

Publication date: 21 April 2016

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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 $X^2$ determine the orbits of $G$ on $X^n$ 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 $S_n$, 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.

Full work available at URL: https://arxiv.org/abs/1506.04187

Recommendations

• Cherlin's conjecture for almost simple groups of Lie rank 1
• Cherlin's conjecture for sporadic simple groups
• Binary permutation groups: alternating and classical groups
• scientific article; zbMATH DE number 4055862
• On the Burness-Giudici conjecture
• Finite primitive permutation groups and regular cycles of their elements.
• On primitive permutation groups with the stabilizer of two points normal in the stabilizer of one of them.
• Extremely primitive groups and linear spaces.
• Primitive Permutation Groups with a Regular Non-Abelian Normal Subgroup
• ON PRIMITIVE SHARP PERMUTATION GROUPS

zbMATH Keywords

finite permutation groupsprimitive permutation groupsbinary permutation groups

Mathematics Subject Classification ID

Characterization theorems for permutation groups (20B10) Primitive groups (20B15)

Cites Work

• On a combinatorial problem from the model theory of wreath products. I
• Arities of permutation groups: Wreath products and \(k\)-sets
• On a combinatorial problem from the model theory of wreath products. III
• On the relational complexity of a finite permutation group
• Title not available (Why is that?)
• Title not available (Why is that?)
• Primitive Subgroups of Wreath Products in Product Action
• On countable stable structures which are homogeneous for a finite relational language

Cited In (9)

• On the Burness-Giudici conjecture
• On the relational complexity of a finite permutation group
• Binary permutation groups: alternating and classical groups
• Cherlin's conjecture for almost simple groups of Lie rank 1
• Cherlin's conjecture for sporadic simple groups
• On a conjecture on the permutation characters of finite primitive groups
• A classification of finite primitive IBIS groups with alternating socle
• The binary actions of simple groups with a single conjugacy class of involutions
• Cherlin's conjecture for finite primitive binary permutation groups

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)