Orbit equivalence and permutation groups defined by unordered relations.

DOI10.1007/s10801-011-0313-5zbMath1256.20001arXiv1010.3536OpenAlexW2093678272MaRDI 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 groupsimprimitive permutation groupsorbit closed groupsregular setsset-transitive groupsunordered relations

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Primitive groups (20B15) General theory for finite permutation groups (20B05)

Related Items (9)

Finite primitive groups and edge-transitive hypergraphs ⋮ On orbit closures of groups ⋮ Symmetry groups of Boolean functions. ⋮ Wreath product in automorphism groups of graphs ⋮ Orbit closed permutation groups, relation groups, and simple groups ⋮ Orbit-equivalent infinite permutation groups. ⋮ 2-closed abelian permutation groups ⋮ Graphical representations of cyclic permutation groups ⋮ Abelian permutation groups with graphical representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Orbit equivalence and permutation groups defined by unordered relations.