On the primary coverings of finite solvable and symmetric groups (Q2240143)

This is an article about primary coverings of finite groups. If \(G\) is a finite group, then a family of proper subgroups of \(G\) is called a covering of \(G\) if and only if the union of the subgroups in the family is exactly \(G\). Next we denote by \(G_0\) the set of elements of \(G\) of prime power order. Then a family of proper subgroups of \(G\) is a primary covering if and only if the union of the subgroups in this family contains \(G_0\). Coverings and covering numbers (i.e. the minimal number of proper subgroups necessary for a covering) have been studied for some decades now, from various perspectives, and the covering numbers for solvable groups and for symmetric groups are known [\textit{M. J. Tomkinson}, Math. Scand. 81, No. 2, 191--198 (1997; Zbl 0905.20014); \textit{A. Maróti}, J. Comb. Theory, Ser. A 110, No. 1, 97--111 (2005; Zbl 1066.20004)]. In this paper, the authors investigate the primary covering number for two types of groups. This means that they find the minimal number of proper subgroups necessary for a primary covering of such groups. If \(G\) is a finite solvable group that is not cyclic of prime power order, and if \(G/G'\) also does not have prime power order, then the primary covering number is \(2\). Otherwise, the covering number and the primary covering number coincide. The primary covering numbers for the symmetric groups \(\mathrm{Sym}_n\) are \(4\) if \(n=3\) and \(7\) if \(n=6\). For the remaining numbers (starting with \(n=4\)), the authors also give formulae for the primary covering numbers, with a case distinction depending on whether \(n\) is a power of 2, a power of \(2\) times 3 or a number with a different factorization. In the process, the authors prove general results about hereditary properties of primary covering numbers and use previous work by Maroti and others.