Transition matrices and Pieri-type rules for polysymmetric functions
Open Access
- 1 September 2025
- journal article
- Published by MathDoc/Centre Mersenne in Algebraic Combinatorics
- Vol. 8 (4) , 1085-1117
Abstract
Asvin G and Andrew O’Desky recently introduced the graded algebra 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 that are analogous to well-known classical formulas for . In more detail, we consider pure tensor bases , , and for 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 of Eğecioğlu and Remmel. These objects arise by iteration of new Pieri-type rules that give expansions of products such as , , etc.
Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Proof of the Plethystic Murnaghan–Nakayama Rule Using Loehr’s Labelled AbacusAnnals of Combinatorics, 2024
- Plethysm and the algebra of uniform block permutationsAlgebraic Combinatorics, 2022
- A Combinatorial Proof of a Plethystic Murnaghan--Nakayama RuleSIAM Journal on Discrete Mathematics, 2016
- A computational and combinatorial exposé of plethystic calculusJournal of Algebraic Combinatorics, 2010
- The combinatorics of transition matrices between the bases of the symmetric functions and the Bn analoguesDiscrete Mathematics, 1996
- Brick tabloids and the connection matrices between bases of symmetric functionsDiscrete Applied Mathematics, 1991