2000 character limit reached
On the covering number of symmetric groups of even degree
Published 28 Oct 2014 in math.GR | (1410.7524v2)
Abstract: If a group $G$ is the union of proper subgroups $H_1, \dots, H_k$, we say that the collection ${H_1, \dots H_k }$ is a cover of $G$, and the size of a minimal cover (supposing one exists) is the covering number of $G$, denoted $\sigma(G)$. Mar\'oti showed that $\sigma(S_n) = 2{n-1}$ for $n$ odd and sufficiently large, and he also gave asymptotic bounds for $n$ even. In this paper, we determine the exact value of $\sigma(S_n)$ when $n$ is divisible by $6$.
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.