arXiv:1410.0420 [math.GR]AbstractReferencesReviewsResources
Permutation Groups and Orbits on Power Sets
Published 2014-10-02Version 1
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_2 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$).
Categories: math.GR
Related articles: Most relevant | Search more
arXiv:1602.07829 [math.GR] (Published 2016-02-25)
The number of composition factors of order $p$ in completely reducible groups of characteristic $p$
arXiv:2306.01410 [math.GR] (Published 2023-06-02)
On the orders of composition factors in completely reducible groups
arXiv:1712.03688 [math.GR] (Published 2017-12-11)
On the Saxl graph of a permutation group