2000 character limit reached
On minimal coverings and pairwise generation of some primitive groups of wreath product type
Published 9 Jan 2023 in math.GR | (2301.03691v1)
Abstract: The covering number of a finite group $G$, denoted $\sigma(G)$, is the smallest positive integer $k$ such that $G$ is a union of $k$ proper subgroups. We calculate $\sigma(G)$ for a family of primitive groups $G$ with a unique minimal normal subgroup $N$, isomorphic to $A_nm$ with $n$ divisible by $6$ and $G/N$ cyclic. This is a generalization of a result of E. Swartz concerning the symmetric groups. We also prove an asymptotic result concerning pairwise generation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.