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

We provide elementary identities relating the three known types of non-symmetric interpolation Macdonald polynomials. In addition we derive a duality for non-symmetric interpolation Macdonald polynomials. We consider some applications of these results, in particular for binomial formulas involving non-symmetric interpolation Macdonald polynomials.

In this paper, we consider the generating functions of the complete and elementary symmetric functions and provide a new generalization of these classical symmetric functions. Some classical relationships involving the complete and elementary symmetric functions are reformulated in a more general context. Combinatorial interpretations of these generalized symmetric functions are also introduced.

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We mainly use the combinatorial interpretation of Haglund, Haiman and Loehr giving the expansion of the modified Macdonald polynomials on the monomial basis.

The quasisymmetic Macdonald polynomials $G_{\gamma}(X; q, t)$ were recently introduced by the first and second authors with Haglund, Mason, and Williams in [3] to refine the symmetric Macdonald polynomials $P_{\lambda}(X; q, t)$ with the property that $G_{\gamma}(X; 0, 0)$ equals $QS_{\gamma}(X)$, the quasisymmetric Schur polynomial of [9]. We derive an expansion for $G_{\gamma}(X; q, t)$ in the fundamental basis of quasisymmetric functions.

We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.

A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of the Jing-J\"ozefiak formula for two-row Macdonald functions.

We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier pairing and the binomial formula.

We extend some results about shifted Schur functions to the general context of shifted Macdonald polynomials. We obtain two explicit formulas for these polynomials: a $q$-integral representation and a combinatorial formula. Our main tool is a $q$-integral representation for ordinary Macdonald polynomials. We also discuss duality for shifted Macdonald polynomials and Jack degeneration of these polynomials.

We prove that Macdonald polynomials are characters of irreducible Cherednik algebra modules.

We introduce deformations of Kazhdan-Lusztig elements and specialised nonsymmetric Macdonald polynomials, both of which form a distinguished basis of the polynomial representation of a maximal parabolic subalgebra of the Hecke algebra. We give explicit integral formula for these polynomials, and explicitly describe the transition matrices between classes of polynomials. We further develop a combinatorial interpretation of homogeneous evaluations using an expansion in terms of...