A combinatorial approach to the \(q,t\)-symmetry relation in Macdonald polynomials (Q289979)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A combinatorial approach to the \(q,t\)-symmetry relation in Macdonald polynomials |
scientific article |
Statements
A combinatorial approach to the \(q,t\)-symmetry relation in Macdonald polynomials (English)
0 references
1 June 2016
0 references
Summary: Using the combinatorial formula for the transformed Macdonald polynomials of \textit{J. Haglund} et al. [J. Am. Math. Soc. 18, No. 3, 735--761 (2005; Zbl 1061.05101)], we investigate the combinatorics of the symmetry relation \(\widetilde{H}_\mu(\mathbf{x};q,t)=\widetilde{H}_{\mu^{\ast}}(\mathbf{x};t,q)\). We provide a purely combinatorial proof of the relation in the case of Hall-Littlewood polynomials (\(q=0\)) when \(\mu\) is a partition with at most three rows, and for the coefficients of the square-free monomials in \(\mathbf{x}\) for all shapes \(\mu\). We also provide a proof for the full relation in the case when \(\mu\) is a hook shape, and for all shapes at the specialization \(t=1\). Our work in the Hall-Littlewood case reveals a new recursive structure for the cocharge statistic on words.
0 references
Macdonald polynomials
0 references
Hall-Littlewood polynomials
0 references
Young tableaux
0 references
cocharge
0 references
Garsia-Procesi modules
0 references
Mahonian statistics
0 references