Abstract
This paper discusses upper bounds on the minimal number of elements d(G) required to generate a transitive permutation group G, in terms of its degree n, and its order |G|. In particular, we reduce a conjecture of L. Pyber on the number of subgroups of the symmetric group Sym(n). We also prove that our bounds are best possible.
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.
