A property of alternating groups

Abstract: We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that every element of A_n is a commutator in the symmetric group S_n.

This page was built for publication: A property of alternating groups

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