Arities of permutation groups: Wreath products and \(k\)-sets

DOI10.1006/JCTA.1996.0050zbMath0854.20002OpenAlexW1995741943MaRDI QIDQ1914011

Gary A. Martin, Daniel H. Saracino, Gregory L. Cherlin

Publication date: 9 July 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.0050

zbMATH Keywords

typessymmetric groupsorbitsprimitive permutation groupsfinite permutation groupssharply transitive groupsupper and lower estimatesO'Nan-Scott theoremaritypower actions of wreath productsweak arity

Mathematics Subject Classification ID

Extensions, wreath products, and other compositions of groups (20E22) Symmetric groups (20B30) Primitive groups (20B15) General theory for finite permutation groups (20B05)

Related Items (12)

Statistics for \(S_n\) acting on \(k\)-sets ⋮ Equivariant algorithms for constraint satisfaction problems over coset templates ⋮ On relational complexity and base size of finite primitive groups ⋮ ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP ⋮ Partitions and indivisibility properties of countable dimensional vector spaces ⋮ Irredundant bases for finite groups of Lie type ⋮ On a combinatorial problem from the model theory of wreath products. III ⋮ Irredundant bases for the symmetric group ⋮ A reduction theorem for primitive binary permutation groups ⋮ 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 the relational complexity of a finite permutation group

This page was built for publication: Arities of permutation groups: Wreath products and \(k\)-sets