Loading…

Finite Permutation Groups with Few Orbits Under the Action on the Power Set

We study the orbits under the natural action of a permutation group \(G \subseteq S_n\) on the powerset \(\mathscr{P}(\{1, \dots , n\})\). The permutation groups having exactly \(n+1\) orbits on the powerset can be characterized as set-transitive groups and were fully classified in \cite{BP55}. In t...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-08
Main Authors: Betz, Alexander, Chao-Haft, Max, Gong, Ting, Keller, Thomas Michael, Ter-Saakov, Anthony, Yang, Yong
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the orbits under the natural action of a permutation group \(G \subseteq S_n\) on the powerset \(\mathscr{P}(\{1, \dots , n\})\). The permutation groups having exactly \(n+1\) orbits on the powerset can be characterized as set-transitive groups and were fully classified in \cite{BP55}. In this paper, we establish a general method that allows one to classify the permutation groups with \(n+r\) set-orbits for a given \(r\), and apply it to integers \(2 \leq r \leq 15\) using the computer algebra system GAP.
ISSN:2331-8422