Alternating groups as products of cycle classes

From MaRDI portal



Abstract: Given integers k,lgeq2, where either l is odd or k is even, let n(k,l) denote the largest integer n such that each element of An is a product of k many l-cycles. In 2008, M. Herzog, G. Kaplan and A. Lev proved that if k,l both are odd, 3midl and l>3, then n(k,l)=frac23kl. They further conjectured that if k is even and 3midl, then n(k,l)=frac23kl+1. In this article, we prove this conjecture. We also prove that n(k,3)=2k+1 if k is odd.


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\).











This page was built for publication: Alternating groups as products of cycle classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041878)