Permutation Groups and Orbits on Power Sets

2014/10/02 by Yang, Yong
#FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1410.0420

Abstract

Let G be a permutation group of degree n and let s(G) denote the number of set-orbits of G. We determine inf(\frac log₂ s(G) n) over all groups G that satisfy certain restrictions on composition factors (i.e. Alt(k), k > 4 cannot be obtained as a quotient of a subgroup of G).

Related

• Finite Permutation Groups with Few Orbits Under the Action on the Power Set
• On the orbit-sizes of permutation groups containing elements separating finite subsets
• Group Marriage Problem
• Closures of permutation groups with restricted nonabelian composition factors
• The k-orbit theory and Fein-Kantor-Schacher Theorem