A reduction theorem for primitive binary permutation groups.
From MaRDI portal
Publication:2801723
Abstract: A permutation group is said to be binary, or of relational complexity , if for all , the orbits of (acting diagonally) on determine the orbits of on in the following sense: for all , and are -conjugate if and only if every pair of entries from is -conjugate to the corresponding pair from . Cherlin has conjectured that the only finite primitive binary permutation groups are , groups of prime order, and affine orthogonal groups where 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.
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
Cites work
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 1421206 (Why is no real title available?)
- Arities of permutation groups: Wreath products and \(k\)-sets
- On a combinatorial problem from the model theory of wreath products. I
- On a combinatorial problem from the model theory of wreath products. III
- On countable stable structures which are homogeneous for a finite relational language
- On the relational complexity of a finite permutation group
- Primitive Subgroups of Wreath Products in Product Action
Cited in
(9)- On the relational complexity of a finite permutation group
- On the Burness-Giudici conjecture
- 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)