arXiv Analytics

Sign in

arXiv:1503.02109 [math.CO]AbstractReferencesReviewsResources

A combinatorial approach to the q,t-symmetry relation in Macdonald polynomials

Maria Monks Gillespie

Published 2015-03-06Version 1

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, 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.

Related articles: Most relevant | Search more
arXiv:1602.01126 [math.CO] (Published 2016-02-02)
A Combinatorial Approach to the Symmetry of $q,t$-Catalan Numbers
arXiv:1411.3646 [math.CO] (Published 2014-11-13)
Haglund's conjecture on 3-column Macdonald polynomials
arXiv:0804.0027 [math.CO] (Published 2008-03-31, updated 2008-05-09)
A combinatorial proof of Rayleigh monotonicity for graphs