Transition matrices and Pieri-type rules for polysymmetric functions
Aditya Khanna, Nicholas A. Loehr

TL;DR
This paper develops combinatorial formulas and Pieri-type rules for polysymmetric functions, generalizing classical symmetric function theory with new tableau-like structures and transition matrices.
Contribution
It introduces new Pieri-type rules and tableau-like combinatorial formulas for the algebra of polysymmetric functions, extending classical symmetric function results.
Findings
Derived expansion formulas for non-pure bases in polysymmetric functions
Established new tableau-like combinatorial objects for these expansions
Formulated Pieri-type rules for product expansions in PΛ
Abstract
Asvin G and Andrew O'Desky recently introduced the graded algebra P of polysymmetric functions as a generalization of the algebra of symmetric functions. This article develops combinatorial formulas for some multiplication rules and transition matrix entries for P that are analogous to well-known classical formulas for . In more detail, we consider pure tensor bases , , and for P that arise as tensor products of the classical Schur basis, power-sum basis, and monomial basis for . We find expansions in these bases of the non-pure bases , , , and studied by Asvin G and O'Desky. The answers involve tableau-like structures generalizing semistandard tableaux, rim-hook tableaux, and the brick tabloids…
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
TopicsMatrix Theory and Algorithms
