AbstractIn this paper we use the combinatorics of alcove walks to give uniform combinatorial formulas for Macdonald polynomials for all Lie types. These formulas resemble the formulas of Haglund, Haiman and Loehr for Macdonald polynomials of type GLn. At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms of the Littelmann path model (in the positively folded gallery form of Gaussent and Littelmann)
Symmetric and nonsymmetric Macdonald polynomials associated to root systems are very general familie...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
AbstractKnop and Sahi simultaneously introduced a family of non-homogeneous, non-symmetric polynomia...
AbstractIn this paper we use the combinatorics of alcove walks to give uniform combinatorial formula...
Abstract: We prove a combinatorial formula for the Macdonald polynomial $\tilde{H}_{\mu }(x;q,t)$...
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatoria...
We apply a result of Ram and Yip in order to give a combinatorial formula in terms of alcove walks f...
The theory of symmetric functions is ubiquitous throughout mathematics. They arise naturally in comb...
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Lo...
Abstract. We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop co...
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded ...
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded ...
AbstractKnop and Sahi simultaneously introduced a family of non-homogeneous, non-symmetric polynomia...
Nonsymmetric Macdonald polynomials are a polynomial generalization of their symmetric counterparts t...
The aim of this note is to give some factorization formulas for different versions of the Macdonald ...
Symmetric and nonsymmetric Macdonald polynomials associated to root systems are very general familie...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
AbstractKnop and Sahi simultaneously introduced a family of non-homogeneous, non-symmetric polynomia...
AbstractIn this paper we use the combinatorics of alcove walks to give uniform combinatorial formula...
Abstract: We prove a combinatorial formula for the Macdonald polynomial $\tilde{H}_{\mu }(x;q,t)$...
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatoria...
We apply a result of Ram and Yip in order to give a combinatorial formula in terms of alcove walks f...
The theory of symmetric functions is ubiquitous throughout mathematics. They arise naturally in comb...
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Lo...
Abstract. We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop co...
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded ...
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded ...
AbstractKnop and Sahi simultaneously introduced a family of non-homogeneous, non-symmetric polynomia...
Nonsymmetric Macdonald polynomials are a polynomial generalization of their symmetric counterparts t...
The aim of this note is to give some factorization formulas for different versions of the Macdonald ...
Symmetric and nonsymmetric Macdonald polynomials associated to root systems are very general familie...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
AbstractKnop and Sahi simultaneously introduced a family of non-homogeneous, non-symmetric polynomia...