A property of alternating groups
Abstract
We describe an efficient algorithm to write any element of the alternating group An as a product of two n-cycles (in particular, we show that any element of An can be so written -- a result of E. A. Bertram). An easy corollary is that every element of An is a commutator in the symmetric group Sn.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.