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

DOI10.1216/RMJ.2021.51.1553MaRDI QIDQ6323061arXivFDO

Authors Alexander Betz, Max Chao-Haft, Ting Gong, Thomas Michael Keller, Anthony Ter-Saakov, Yong Yang

Publication date 1 August 2019

Published in arXiv

Full work available at URL https://doi.org/10.1216/RMJ.2021.51.1553

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05)

arXiv classification

math.GR

Abstract: We study the orbits under the natural action of a permutation group

G s u b s e t e q S_{n}

on the powerset

m a t h s c r P (1, d o t s, 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 l e q r l e q 15

using the computer algebra system GAP.

This page was built for publication: Finite Permutation Groups with Few Orbits Under the Action on the Power Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323061)