Alternating groups as products of cycle classes (Q6041878): Difference between revisions

The authors continue the researches by \textit{M. Herzog} et al. [J. Comb. Theory, Ser. A 115, No. 7, 1235--1245 (2008; Zbl 1172.20002)]. Let \(A_n\) denote the alternating group on \(n\) letters. The integer \(n(k,l)\) is defined as the largest integer such that every permutation in \(A_n\) is a product of \(k\) cycles of length \(l\). It is proved that if \(k \geq 2\) is any natural number, then \(n(k, 3) = 2k + 1\), and if \(k \geq 2\) and \(l > 3\) are two natural numbers such that \(k\) is even and \(3 \mid l\), then \(n(k, l) = \frac{2}{3}kl +1\).