On the relational complexity of a finite permutation group

DOI10.1007/s10801-015-0636-8zbMath1378.20001OpenAlexW1815329339MaRDI QIDQ256538

Gregory L. Cherlin

Publication date: 9 March 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-015-0636-8

zbMATH Keywords

orthogonal grouphomogeneityaffinesimple groupbinaryfinite model theoryfinite permutation groupprimitiverelational complexity

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Model-theoretic algebra (03C60) Model theory of finite structures (03C13) Primitive groups (20B15) General theory for finite permutation groups (20B05) Characterization theorems for permutation groups (20B10)

Related Items (6)

Statistics for \(S_n\) acting on \(k\)-sets ⋮ Homogenizable structures and model completeness ⋮ ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP ⋮ A reduction theorem for primitive binary permutation groups ⋮ Cherlin's conjecture for sporadic simple groups ⋮ Cherlin's conjecture for almost simple groups of Lie rank 1

Cites Work

• Homogeneous graphs
• On a combinatorial problem from the model theory of wreath products. I
• On a combinatorial problem from the model theory of wreath products. II
• Arities of permutation groups: Wreath products and \(k\)-sets
• On a combinatorial problem from the model theory of wreath products. III
• On a theorem of Philip Hall
• On groups with abelian Sylow 2-subgroups
• A reduction theorem for primitive binary permutation groups
• The Finite Simple Groups
• Smoothly Embeddable Subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the relational complexity of a finite permutation group