The p-width of the alternating groups
Alexander J. Malcolm

TL;DR
This paper investigates the minimal number of elements of prime order needed to express any element in alternating groups, establishing an upper bound of three and demonstrating its sharpness for various primes.
Contribution
It proves that the p-width of alternating groups is at most 3 for all sufficiently large n, and shows this bound is optimal for each prime p.
Findings
The p-width of A_n is at most 3 for all n ≥ p.
The bound of 3 is sharp, with examples achieving this maximum.
The result applies to all primes p and large enough n.
Abstract
Let be a fixed prime. For a finite group generated by elements of order , the -width is defined to be the minimal such that any group element can be written as a product of at most elements of order . Let denote the alternating group of even permutations on letters. We show that the -width of is at most . This result is sharp, as there are families of alternating groups with -width precisely 3, for each prime .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
