ARTICLE
TITLE

A Combinatorial Approach to the q,tq,t-Symmetry Relation in Macdonald Polynomials

SUMMARY

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation ˜Hµ(x;q,t)=˜Hµ*(x;t,q)\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=0q=0) when µ\mu is a partition with at most three rows, and for the coefficients of the square-free monomials in x\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=1t=1. Our work in the Hall-Littlewood case reveals a new recursive structure for the cocharge statistic on words.

 Articles related

Gaspard Ohlmann    

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d=0d=0. Their values have already been computed by Kim and Stanton in 2015... see more


Éric Fusy    

Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number an(s)a_n(\sigma) of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with n=1n\geq 1 leaves, fixed (for the ... see more


Forest Tong    

We introduce a class of graphs called compound graphs, which are constructed out of copies of a planar bipartite base graph, and explore the number of perfect matchings of compound graphs. The main result is that the number of matchings of every compound... see more


Hannah E. Burson, Simone Sisneros-Thiry, Armin Straub    

Using a combinatorial bijection with certain abaci diagrams, Nath and Sellers have enumerated (s,ms±1)(s,ms\pm 1)-core partitions into distinct parts. We generalize their result in several directions by including the number of parts of these partitions, ... see more


Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, Jean-Marie Maillard    

A small set of combinatorial sequences have coefficients that can be represented as moments of a nonnegative measure on [0,8)[0, \infty). Such sequences are known as Stieltjes moment sequences. They have a number of nice properties, such as log-convexity... see more