Related papers: Monk rules for type $GL_n$ Macdonald polynomials

A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…

Multiline queues are versatile combinatorial objects that play a key role in understanding the remarkable connection between the asymmetric simple exclusion process (ASEP) on a circle and Macdonald polynomials. Specializing the results of…

Quantum analogues of the homogeneous spaces $\GL(n)/\SO(n)$ and $\GL(2n)/\Sp(2n)$ are introduced. The zonal spherical functions on these quantum homogeneous spaces are represented by Macdonald's symmetric polynomials…

We give the explicit analytic development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments…

In this paper we present a formula for Macdonald's polynomials for the root system A(n-1) which arises from the representation theory of quantum sl(n). This formula expresses Macdonald's polynomials via (weighted) traces of intertwining…

Elliptic Macdonald polynomials of sl(2)-type and level 2 are introduced. Suitable limits of elliptic Macdonald polynomials are the standard Macdonald polynomials and conformal blocks. Identities for elliptic Macdonald polynomials, in…

In this note we give a short proof of Cherednik's generalization of Macdonald-Mehta identities for the root system $A_{n-1}$ using the representation theory of quantum groups. These identities, suggested and proved by Cherednik, give an…

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 bijective proofs of Monk's rule for Schubert and double Schubert polynomials computed with bumpless pipe dreams. In particular, they specialize to bijective proofs of transition and cotransition formulas of Schubert and double…

This paper is a supplement to Guo-Ram arXiv:2104.02942, containing examples, remarks and additional material that could be useful to researchers working with Type $GL_n$ Macdonald polynomials. In the course of our comparison of the alcove…

We consider products of two Macdonald polynomials of type A, indexed by dominant weights which are respectively a multiple of the first fundamental weight and a weight having zero component on the k-th fundamental weight. We give the…

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…

By applying a Gr\"{o}bner-Shirshov basis of the symmetric group $S_{n}$, we give two formulas for Schubert polynomials, either of which involves only nonnegative monomials. We also prove some combinatorial properties of Schubert…

We express the integral form Macdonald polynomials as a weighted sum of Shareshian and Wachs' chromatic quasisymmetric functions of certain graphs. Then we use known expansions of these chromatic quasisymmetric functions into Schur and…

Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…

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…

In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial…

We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…

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…

We give a new representation-theoretic proof of the branching rule for Macdonald polynomials using the Etingof-Kirillov Jr. expression for Macdonald polynomials as traces of intertwiners of U_q(gl_n). In the Gelfand-Tsetlin basis, we show…