On the relational complexity of a finite permutation group

DOI10.1007/S10801-015-0636-8MaRDI QIDQ256538zbMATH OpenOpenAlexFDO

Authors Gregory 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

affinebinaryfinite model theoryfinite permutation grouphomogeneityorthogonal groupprimitiverelational complexitysimple group

Mathematics Subject Classification ID

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

Recommendations

• ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
• Permutation groups defined by unordered relations.
• Cherlin's conjecture for finite primitive binary permutation groups
• On relational complexity and base size of finite primitive groups
• Orbit equivalence and permutation groups defined by unordered relations.

Cites work

• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 44603 (Why is no real title available?)
• scientific article; zbMATH DE number 3506951 (Why is no real title available?)
• scientific article; zbMATH DE number 1111401 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• scientific article; zbMATH DE number 1421206 (Why is no real title available?)
• scientific article; zbMATH DE number 3392741 (Why is no real title available?)
• A reduction theorem for primitive binary permutation groups.
• Arities of permutation groups: Wreath products and \(k\)-sets
• 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
• 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
• Smoothly Embeddable Subgraphs
• The Finite Simple Groups

Cited in

(11)

• ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
• On the complexity of coloring areflexive \(h\)-ary relations with given permutation group
• Geometric groups of second order and related combinatorial structures
• Cherlin's conjecture for almost simple groups of Lie rank 1
• Independence and bases: theme and variations
• The relational complexity of linear groups acting on subspaces
• Cherlin's conjecture for sporadic simple groups
• Statistics for \(S_n\) acting on \(k\)-sets
• Homogenizable structures and model completeness
• A reduction theorem for primitive binary permutation groups.
• The binary actions of simple groups with a single conjugacy class of involutions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256538)