2000 character limit reached
Covering certain monolithic groups with proper subgroups
Published 22 Nov 2012 in math.GR | (1211.5345v1)
Abstract: Given a finite non-cyclic group $G$, call $\sigma(G)$ the least number of proper subgroups of $G$ needed to cover $G$. In this paper we give lower and upper bounds for $\sigma(G)$ for $G$ a group with a unique minimal normal subgroup $N$ isomorphic to $A_nm$ where $n \geq 5$ and $G/N$ is cyclic. We also show that $\sigma(A_5 \wr C_2)=57$.
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.