A reduction theorem for primitive binary permutation groups

DOI10.1112/blms/bdw005zbMath1350.20002arXiv1506.04187OpenAlexW3101427689MaRDI QIDQ2801723

Joshua Wiscons

Publication date: 21 April 2016

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

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

zbMATH Keywords

primitive permutation groupsfinite permutation groupsbinary permutation groups

Mathematics Subject Classification ID

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

Related Items (3)

Cherlin's conjecture for sporadic simple groups ⋮ Cherlin's conjecture for almost simple groups of Lie rank 1 ⋮ On the relational complexity of a finite permutation group

Cites Work

• On the relational complexity of a finite permutation group
• On countable stable structures which are homogeneous for a finite relational language
• 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
• Primitive Subgroups of Wreath Products in Product Action
• Unnamed Item
• Unnamed Item

This page was built for publication: A reduction theorem for primitive binary permutation groups