Orbit equivalence and permutation groups defined by unordered relations.

DOI10.1007/s10801-011-0313-5zbMath1256.20001arXiv1010.3536MaRDI QIDQ424390

Francesca Dalla Volta, Johannes Siemons

Publication date: 1 June 2012

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

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

zbMATH Keywords

closed permutation groups; imprimitive permutation groups; orbit closed groups; regular sets; set-transitive groups; unordered relations

Mathematics Subject Classification ID

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

20B15: Primitive groups

20B05: General theory for finite permutation groups

Related Items

Finite primitive groups and edge-transitive hypergraphs, Symmetry groups of Boolean functions., 2-closed abelian permutation groups, Abelian permutation groups with graphical representations, Graphical representations of cyclic permutation groups, Orbit-equivalent infinite permutation groups., On orbit closures of groups

Cites Work

• Regular orbits for projective orthogonal groups over finite fields of odd characteristic
• Primitive \(k\)-free permutation groups.
• On groups with no regular orbits on the set of subsets
• Regular sets and geometric groups
• Regular sets for the affine and projective groups over the field of two elements
• On partitions and permutation groups on unordered sets
• Symmetry groups of Boolean functions and constructions of permutation groups
• On the orders of primitive groups
• Symmetry breaking in graphs
• Distinguishing number of countable homogeneous relational structures
• Primitive Groups with no Regular Orbits on the Set of Subsets
• Trivial Set-Stabilizers in Finite Permutation Groups
• Set-Transitive Permutation Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item