On the Existence of Elementwise Invariant Vectors in Representations of Symmetric Groups
Amrutha P, Amritanshu Prasad, Velmurugan S

TL;DR
This paper characterizes when irreducible representations of symmetric groups have non-zero invariant vectors under permutations, revealing that most pairs of representations and permutations possess this property with few exceptions.
Contribution
It provides a complete characterization of the pairs (, ) for which invariant vectors exist in irreducible symmetric group representations, identifying the conditions and exceptions.
Findings
Most pairs (, ) have invariant vectors in irreducible representations.
A small number of simple exceptions where invariant vectors do not exist.
The results clarify the structure of symmetric group representations under permutation actions.
Abstract
We determine when a permutation with cycle type admits a non-zero invariant vector in the irreducible representation of the symmetric group. We find that a majority of pairs have this property, with only a few simple exceptions.
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
TopicsAdvanced Combinatorial Mathematics · Genome Rearrangement Algorithms · graph theory and CDMA systems
