On minimal coverings and pairwise generation of some primitive groups of wreath product type
Martino Garonzi, Julia Almeida

TL;DR
This paper determines the minimal covering number for certain primitive groups with a specific normal subgroup structure and explores asymptotic properties of pairwise generation, extending previous results on symmetric groups.
Contribution
It generalizes the calculation of covering numbers to a broader class of primitive groups and investigates pairwise generation asymptotics.
Findings
Calculated covering number for specific primitive groups
Extended results to groups with normal subgroup isomorphic to A_n^m
Provided asymptotic analysis of pairwise generation
Abstract
The covering number of a finite group , denoted , is the smallest positive integer such that is a union of proper subgroups. We calculate for a family of primitive groups with a unique minimal normal subgroup , isomorphic to with divisible by and cyclic. This is a generalization of a result of E. Swartz concerning the symmetric groups. We also prove an asymptotic result concerning pairwise generation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory
