Normal coverings and pairwise generation of finite alternating and symmetric groups

preprint2013arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.