arXiv Analytics

Sign in

arXiv:1211.2559 [math.GR]AbstractReferencesReviewsResources

Normal coverings and pairwise generation of finite alternating and symmetric groups

Daniela Bubboloni, Cheryl E. Praeger, Pablo Spiga

Published 2012-11-12, updated 2013-01-29Version 3

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$ such that, for $G$ a symmetric group $\Sym(n)$ or an alternating group $\Alt(n)$, $\gamma(G)\geq cn$. This improves results of the first two authors who had earlier proved that $a\varphi(n)\leq\gamma(G)\leq 2n/3,$ for some positive constant $a$, where $\varphi$ is the Euler totient function. Bounds are also obtained for the maximum size $\kappa(G)$ of a set $X$ of conjugacy classes of $G=\Sym(n)$ or $\Alt(n)$ such that any pair of elements from distinct classes in $X$ generates $G$, namely $cn\leq \kappa(G)\leq 2n/3$.

Related articles: Most relevant | Search more
arXiv:1611.02501 [math.GR] (Published 2016-11-08)
The Probability of Generating the Symmetric Group
arXiv:1911.04516 [math.GR] (Published 2019-11-11)
Boolean lattices in finite alternating and symmetric groups
arXiv:2009.00897 [math.GR] (Published 2020-09-02)
Word Measures on Symmetric Groups