Alternating groups as products of cycle classes
Abstract
Given integers k,l≥ 2, 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, 3 l and l>3, then n(k,l)=23kl. They further conjectured that if k is even and 3 l, then n(k,l)=23kl+1. In this article, we prove this conjecture. We also prove that n(k,3)=2k+1 if k is odd.
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.