A short proof of generalized Jacobi-Trudi expansions for Macdonald polynomials

The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the symmetric group. One may define a coproduct on $\Lambda$ by the plethystic addition on alphabets. In this way the ring of symmetric functions becomes a Hopf algebra. The Littlewood--Richardson numbers may be viewed as the structure constants for th...

The branching coefficients in the expansion of the elementary symmetric function multiplied by a symmetric Macdonald polynomial $P_\kappa(z)$ are known explicitly. These formulas generalise the known $r=1$ case of the Pieri-type formulas for the nonsymmetric Macdonald polynomials $E_\eta(z)$. In this paper we extend beyond the case $r=1$ for the nonsymmetric Macdonald polynomials, giving the full generalisation of the Pieri-type formulas for symmetric Macdonald polynomials. T...

We give a short proof of the inner product conjecture for the symmetric Macdonald polynomials of type $A_{n-1}$. As a special case, the corresponding constant term conjecture is also proved.

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a corollary to the result that generalized dual equivalence classes of permutations are unions of standard dual equivalence classes of permutations for certain cases, establishing an earlier conjecture of the author.

We prove a binomial formula for Macdonald polynomials and consider applications of it.

We give a combinatorial formula for the non-symmetric Macdonald polynomials E_{\mu}(x;q,t). The formula generalizes our previous combinatorial interpretation of the integral form symmetric Macdonald polynomials J_{\mu}(x;q,t). We prove the new formula by verifying that it satisfies a recurrence, due to Knop, that characterizes the non-symmetric Macdonald polynomials.

The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack polynomial theory we proceed to derive an expansion formula and a related normalisation. Eigenoperator methods are used to relate the symmetric and antisymmetric Macdonald polynomials, and we discuss how these methods can be extended to special ...

The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.

In this elementary paper we prove that the extra vanishing property characterizes the BC interpolation Macdonald polynomials inside a very general class of multivariate interpolation polynomials. It follows that they are the only polynomials in this class that admit a tableaux sum formula or a q-integral representation.

In this paper we give a convolution identity for the complete and elementary symmetric functions. This result can be used to proving and discovering some combinatorial identities involving $r$-Stirling numbers, $r$-Whitney numbers and $q$-binomial coefficients. As a corollary we derive a generalization of the quantum Vandermonde's convolution identity.