Irreducible Characters for the Symmetric Groups and Kostka Matrices
Ronald F. Fox

TL;DR
This paper explores the relationship between Frobenius and irreducible characters of symmetric groups, presenting methods to invert their linear relations and derive Kostka matrices efficiently.
Contribution
It introduces an efficient inversion method for the Frobenius character relations, revealing the Kostka matrix and irreducible characters without complex calculations.
Findings
Inversion of Frobenius character relations yields Kostka matrices and irreducible characters.
The unitriangular coupling matrix simplifies the inversion process.
A modified monomial identity offers an alternative, though more complex, approach.
Abstract
In an earlier paper [1] it was shown that the Frobenius compound characters for the symmetric groups are related to the irreducible characters by a linear relation that involves a unitriagular coupling matrix that gives the Frobenius characters in terms of linear combinations of the irreducible characters. It is desirable to invert this relationship since we have formulas for the Frobenius characters and want the values for the irreducible characters. This inversion is straightforward and yields both the irreducible characters but also the coupling matrix that turns out to be the Kostka matrix in the original direction. We show that if the Frobenius monomial identity is applied a modification of it, equation (22), produces a monomial formula that produces the Kostka matrix inverse without involving the characters of either type. However it is a formidable task to execute this procedure…
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 · Algebraic structures and combinatorial models · Finite Group Theory Research
