The minimal polynomials of powers of cycles in the ordinary representations of symmetric and alternating groups
Nanying Yang, Alexey Staroletov

TL;DR
This paper determines the minimal polynomials of certain permutations in the irreducible representations of symmetric and alternating groups, focusing on permutations with cycles of equal length.
Contribution
It provides explicit formulas for minimal polynomials of powers of cycles in the ordinary irreducible representations of $A_n$ and $S_n$, a novel result in representation theory.
Findings
Explicit minimal polynomials for permutations with equal-length cycles.
Results applicable to both symmetric and alternating groups.
Enhances understanding of permutation representations in algebra.
Abstract
Denote the alternating and symmetric groups of degree by and respectively. Consider a permutation all of whose nontrivial cycles are of the same length. We find the minimal polynomials of in the ordinary irreducible representations of and .
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
