Abstract: We prove a combinatorial formula for the Macdonald polynomial $\tilde{H}_{\mu }(x;q,t)$ which had been conjectured by Haglund. Corollaries to our main theorem include the expansion of $\tilde{H}_{\mu }(x;q,t)$ in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schützenberger for Hall-Littlewood polynomials, a new proof of Knop and Sahi's combinatorial formula for Jack polynomials as well as a lifting of their formula to integral form Macdonald polynomials, and a new combinatorial rule for the Kostka-Macdonald coefficients $\tilde{K}_{\lambda \mu }(q,t)$ in the case that $\mu $ is a partition with parts $\leq 2$
We study bigraded Sn-modules introduced by Garsia and Haiman as an approach to prove the Macdonald p...
Abstract. We give a combinatorial proof of the factorization formula of modified Macdonald polynomia...
In the 90’s a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some R...
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Lo...
The theory of symmetric functions is ubiquitous throughout mathematics. They arise naturally in comb...
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials $\widet...
AbstractWe present formulas of Rodrigues type giving the Macdonald polynomials for arbitrary partiti...
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatoria...
AbstractIn this paper we use the combinatorics of alcove walks to give uniform combinatorial formula...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
AbstractIn this paper we use the combinatorics of alcove walks to give uniform combinatorial formula...
AbstractThis work is concerned with the Macdonaldq, t-analogue of the Kostka matrix. This matrix rel...
Jack polynomials generalize several classical families of symmetric polynomials, including Schur pol...
We study Macdonald polynomials from a basic hypergeometric series point of view. In particular, we s...
We study bigraded Sn-modules introduced by Garsia and Haiman as an approach to prove the Macdonald p...
We study bigraded Sn-modules introduced by Garsia and Haiman as an approach to prove the Macdonald p...
Abstract. We give a combinatorial proof of the factorization formula of modified Macdonald polynomia...
In the 90’s a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some R...
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Lo...
The theory of symmetric functions is ubiquitous throughout mathematics. They arise naturally in comb...
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials $\widet...
AbstractWe present formulas of Rodrigues type giving the Macdonald polynomials for arbitrary partiti...
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatoria...
AbstractIn this paper we use the combinatorics of alcove walks to give uniform combinatorial formula...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
AbstractIn this paper we use the combinatorics of alcove walks to give uniform combinatorial formula...
AbstractThis work is concerned with the Macdonaldq, t-analogue of the Kostka matrix. This matrix rel...
Jack polynomials generalize several classical families of symmetric polynomials, including Schur pol...
We study Macdonald polynomials from a basic hypergeometric series point of view. In particular, we s...
We study bigraded Sn-modules introduced by Garsia and Haiman as an approach to prove the Macdonald p...
We study bigraded Sn-modules introduced by Garsia and Haiman as an approach to prove the Macdonald p...
Abstract. We give a combinatorial proof of the factorization formula of modified Macdonald polynomia...
In the 90’s a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some R...