Abstract
A permutation group G acting on a set Ω induces a permutation group on the set of all subsets 𝒫(Ω). Let G be a finite permutation group of degree n, and let s(G) denote the number of set-orbits of G. We determine over all solvable groups G. This answers a question of Babai and Pyber [1].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
