Let μ and ν = (ν 1, . . . , ν k ) be partitions such that μ is obtained from ν by adding m parts of sizer. Descouens and Morita proved algebraically that the modified Macdonald polynomials H~μ(X;q,t) satisfy the identity H~μ=H~νH~(rm) when the parameter t is specialize to an mth root of unity. Descouens, Morita, and Numata proved this formula bijectively when r ≤ ν k and r∈{1,2}. This note gives a bijective proof of the formula for all r ≤ ν k
The aim of this note is to give some factorization formulas for different versions of the Macdonald ...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Lo...
AbstractThe subject of this article is a factorization formula for the special values of modified Ma...
Abstract. We give a combinatorial proof of the factorization formula of modified Macdonald polynomia...
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials $\widet...
The aim of this note is to give some factorization formulas for different versions of the Macdonald ...
The Hilbert series of the Garsia–Haiman module Mμ can be described combinatorially as the generatin...
International audienceWe describe a bijective proof of Macdonald's reduced word identity using pipe ...
We prove a binomial formula for Macdonald polynomials and consider applications of it
In this article, we introduce some identities obtained from the inner products of some symmetric pol...
This paper is concerned with finding a combinatorial Schur expansion of the modified Macdonald polyn...
AbstractWe introduce a heuristic embedding of the Macdonald polynomials Pμ(x; q, t) into a family of...
In this article, we introduce some identities obtained from the inner products of some symmetric pol...
Abstract: We prove a combinatorial formula for the Macdonald polynomial $\tilde{H}_{\mu }(x;q,t)$...
The aim of this note is to give some factorization formulas for different versions of the Macdonald ...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Lo...
AbstractThe subject of this article is a factorization formula for the special values of modified Ma...
Abstract. We give a combinatorial proof of the factorization formula of modified Macdonald polynomia...
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials $\widet...
The aim of this note is to give some factorization formulas for different versions of the Macdonald ...
The Hilbert series of the Garsia–Haiman module Mμ can be described combinatorially as the generatin...
International audienceWe describe a bijective proof of Macdonald's reduced word identity using pipe ...
We prove a binomial formula for Macdonald polynomials and consider applications of it
In this article, we introduce some identities obtained from the inner products of some symmetric pol...
This paper is concerned with finding a combinatorial Schur expansion of the modified Macdonald polyn...
AbstractWe introduce a heuristic embedding of the Macdonald polynomials Pμ(x; q, t) into a family of...
In this article, we introduce some identities obtained from the inner products of some symmetric pol...
Abstract: We prove a combinatorial formula for the Macdonald polynomial $\tilde{H}_{\mu }(x;q,t)$...
The aim of this note is to give some factorization formulas for different versions of the Macdonald ...
International audienceWe investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ ...
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Lo...