Orbit closed permutation groups, relation groups, and simple groups
The action of a group \(G\) of permutations on a set \(\Omega\) induces an action of \(G\) on the power set \(P(\Omega)\) of \(\Omega\). The group \(G\) is called orbit closed if any permutation of \(\Omega\) which preserves the orbits of \(G\) on \(P(\Omega)\) lies in \(G\). The group \(G\) is called a relation group if there is a set \(R \subseteq P(\Omega)\) such that \(G\) is the group of all permutations of \(\Omega\) mapping \(R\) to itself. In this paper, the authors conjecture that for all but a ``controllable set of permutation groups it holds that if the group is orbit closed, then it is a relation group. The authors verify the conjecture for simple groups and their subgroups. This result strengthens the evidence provided in the earlier paper [the authors, J. Graph Theory 101, No. 1, 29--51 (2022; \url{doi:10.1002/jgt.22808})] where the conjecture was verified for abelian groups or more generally subgroups of direct products of regular permutation groups. Along the way, the authors prove several structural results about simple orbit closed and relation permutation groups. One motivation for the work is taken from research on the symmetry groups of Boolean functions in \(n\) variables with \(G\) permuting the variables. This setting is equivalent to studying symmetry groups of hypergraphs.
- On orbit equivalent permutation groups
- Orbit equivalence and permutation groups defined by unordered relations.
- scientific article; zbMATH DE number 1254505
- Permutation groups and orbits on the power set
- ORBIT-HOMOGENEITY IN PERMUTATION GROUPS
- Orbits of permutation groups on the power set
- Regular orbits of cyclic subgroups in permutation representations of certain simple groups
- Orbits of Sylow subgroups of finite permutation groups
- Orbits of Infinite Permutation Groups
- A proof of Pyber's base size conjecture
- Base size, metric dimension and other invariants of groups and graphs
- Boolean Functions, Invariance Groups, and Parallel Complexity
- Distinguishing index of graphs with simple automorphism groups
- Distinguishing labeling of the actions of almost simple groups.
- Distinguishing numbers for graphs and groups
- Finite primitive groups and edge-transitive hypergraphs
- Graphical representations of cyclic permutation groups
- scientific article; zbMATH DE number 5380277 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- Invariance groups of finite functions and orbit equivalence of permutation groups.
- Invariance groups of functions and related Galois connections
- Inverse monoids of partial graph automorphisms
- On finite permutation groups with the same orbits on unordered sets
- On groups with no regular orbits on the set of subsets
- Orbit equivalence and permutation groups defined by unordered relations.
- Orbit-equivalent infinite permutation groups.
- Primitive Groups with no Regular Orbits on the Set of Subsets
- Set-Transitive Permutation Groups
- Symmetry groups of Boolean functions and constructions of permutation groups
- Symmetry groups of Boolean functions.
- The distinguishing number of quasiprimitive and semiprimitive groups
- Trivial Set-Stabilizers in Finite Permutation Groups
This page was built for publication: Orbit closed permutation groups, relation groups, and simple groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156186)
