The n-point correlation functions introduced by Bloch and Okounkov have already found several geometric connections and algebraic generalizations. In this Note we formulate a q,t-deformation of this n-point function. The key operator used in our formulation arises from the theory of Macdonald polynomials and affords a vertex operator interpretation. We obtain closed formulas for the n-point functions when n =1,2 in terms of the basic hypergeometric functions. We further generalize the q,t-deformed n-point function to more general vertex operators.
It is shown that the deformed Macdonald-Ruijsenaars operators can be described as the restrictions on certain affine subvarieties of the usual Macdonald-Ruijsenaars operator in infinite number of variables. The ideals of these varieties are shown to be generated by the Macdonald polynomials related to Young diagrams with special geometry. The super Macdonald polynomials and their shifted version are introduced, the combinatorial formulas for them are given.
A multivariable hypergeometric-type formula for raising operators of the Macdonald polynomials is conjectured. It is proved that this agrees with Jing and Jozefiak's expression for the two-row Macdonald polynomials, and also with Lassalle and Schlosser's formula for partitions with length three.
We give a combinatorial formula for the non-symmetric Macdonald polynomials E_μ(x;q,t). The formula generalizes our previous combinatorial interpretation of the integral form symmetric Macdonald polynomials J_μ(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.
We give an explicit Pieri formula for Macdonald polynomials attached to the root system C_n (with equal multiplicities). By inversion we obtain an explicit expansion for two-row Macdonald polynomials of type C.
The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators that recursively build the Macdonald polynomials indexed by two part partitions. We uncover a new basis for these particular Macdonald polynomials and in doing so are able to give an explicit description of their associated $q,t$-Kostka coefficients by assigning a statistic in $q$ and $t$ to each standard tableau.
A characterization of the space of symmetric Laurent polynomials of type $(BC)_n$ which vanish on a certain set of submanifolds is given by using the Koornwinder-Macdonald polynomials. A similar characterization was given previously for symmetric polynomials of type $A_n$ by using the Macdonald polynomials. We use a new method which exploits the duality relation. The method simplifies a part of the proof in the $A_n$ case.
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 give a direct proof of the combinatorial formula for interpolation Macdonald polynomials by introducing certain polynomials, which we call generic Macdonald polynomials, which depend on $d$ additional parameters and specialize to all Macdonald polynomials of degree $d$. The form of these generic polynomials is that of a Bethe eigenfunction and they imitate, on a more elementary level, the $R$-matrix construction of quantum immanants.
We show that the action of classical operators associated to the Macdonald polynomials on the basis of Schur functions, S_λ[X(t-1)/(q-1)], can be reduced to addition in λ-rings. This provides explicit formulas for the Macdonald polynomials expanded in this basis as well as in the ordinary Schur basis, S_λ[X], and the monomial basis, m_λ[X].
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 explicit decomposition of any Macdonald polynomial of type A in terms of this basis.
In the basic representation of $U_q(\hat{sl}(2))$ realized via the algebra of symmetric functions we compare the canonical basis with the basis of Macdonald polynomials with $q=t^2$. We show that the Macdonald polynomials are invariant with respect to the bar involution defined abstractly on the representations of quantum groups. We also prove that the Macdonald scalar product coincides with the abstract Kashiwara form. This implies, in particular, that the Macdonald polynomials form an intermediate basis between the canonical basis and the dual canonical basis, and the coefficients of the tra…
We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a new proof of Knop and Sahi's combinatorial formula for Jack polynomials as well as a lifting of their formula to integral form Macdonald polynomials, and a new combinatorial rule for the Kostka-Macdonald coefficients K_{lambda,mu}(q,t) in the case that mu is a partition with parts…
We give the explicit analytic development of any Jack or Macdonald polynomial in terms of elementary (resp. modified complete) symmetric functions. These two developments are obtained by inverting the Pieri formula.
We construct explicitly non-polynomial eigenfunctions of the difference operators by Macdonald in case $t=q^k$, $k\in{\mathbb Z}$. This leads to a new, more elementary proof of several Macdonald conjectures, first proved by Cherednik. We also establish the algebraic integrability of Macdonald operators at $t=q^k$ ($k\in {\mathbb Z}$), generalizing the result of Etingof and Styrkas. Our approach works uniformly for all root systems including $BC_n$ case and related Koornwinder polynomials. Moreover, we apply it for a certain deformation of $A_n$ root system where the previously known methods do…
A new type of sl_3 basic hypergeometric series based on Macdonald polynomials is introduced. Besides a pair of Macdonald polynomials attached to two different sets of variables, a key-ingredient in the sl_3 basic hypergeometric series is a bisymmetric function related to Macdonald's commuting family of q-difference operators, to the sl_3 Selberg integrals of Tarasov and Varchenko, and to alternating sign matrices. Our main result for sl_3 series is a multivariable generalization of the celebrated q-binomial theorem. In the limit this q-binomial sum yields a new sl_3 Selberg integral for Jack p…
We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam, and Williams. We also introduce a new quasisymmetric analogue of Macdonald polynomials. These "quasisymmetric Macdonald polynomials" refine the (symmetric) Macdonald polynomials and specialize to the quasisymmetric Schur polynomials defined by Haglund, Luoto, Mason, and van Willigenburg.
We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam and Williams. We also introduce a new quasisymmetric analogue of Macdonald polynomials. These quasisymmetric Macdonald polynomials refine the (symmetric) Macdonald polynomials and specialize at $q=t=0$ to the quasisymmetric Schur polynomials defined by Haglund, Luoto, Mason, and van Willigenburg. This is an extended abstract.
Our main aim with these notes is to introduce the combinatorial and symmetric function tools that relate to the description of the Poincare polynomial of the triply graded Khovanov-Rozansky homology of torus links, a.k.a. the (reduced) superpolynomial of these links.
Raising operators of row type are constructed by means of an interpolation method. These are a dual version of the raising operators of column type by A.N.Kirillov and M.Noumi. An extension of the q-binomial coefficients is introduced in relation to the raising operators.
We consider the coincident root loci consisting of the polynomials with at least two double roots andpresent a linear basis of the corresponding ideal in the algebra of symmetric polynomials in terms of the Jack polynomials with special value of parameter $α= -2.$ As a corollary we present an explicit formula for the Hilbert-Poincarè series of this ideal and the generator of the minimal degree as a special Jack polynomial. A generalization to the case of the symmetric polynomials vanishing on the double shifted diagonals and the Macdonald polynomials specialized at $t^2 q = 1$ is also presente…
Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued tableaux formula for Macdonald polynomials. Our hope is that providing set-valued tableaux formulas for Macdonald polynomials will help to strengthen the analogies and possible connections between the calculus of Macdonald polynomials and Schubert calculus.
The Cherednik-Orr conjecture expresses the $t\to\infty$ limit of the nonsymmetric Macdonald polynomials in terms of the PBW twisted characters of the affine level one Demazure modules. We prove this conjecture in several special cases.
We prove a strong factorization property of interpolation Macdonald polynomials when $q$ tends to $1$. As a consequence, we show that Macdonald polynomials have a strong factorization property when $q$ tends to $1$, which was posed as an open question in our previous paper with Féray. Furthermore, we introduce multivariate $q,t$-Kostka numbers and we show that they are polynomials in $q,t$ with integer coefficients by using the strong factorization property of Macdonald polynomials. We conjecture that multivariate $q,t$-Kostka numbers are in fact polynomials in $q,t$ with nonnegative integer c…
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 power sum symmetric functions to provide Schur and power sum formulas for the integral form Macdonald polynomials. Since the (integral form) Jack polynomials are a specialization of integral form Macdonald polynomials, we obtain analogous formulas for Jack polynomials as corollaries.
We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.
Macdonald characters from a new formula for Macdonald polynomials
Université de Lorraine（洛林大学）；CNRS, IECL（法国国家科学研究中心，IECL）；Université de Paris（巴黎大学）；CNRS, IRIF（法国国家科学研究中心，IRIF）；Harvard University（哈佛大学）；Università di Pisa（比萨大学）
This is a paper about $c$-functions and Macdonald polynomials. There are $c$-function formulas for $E$-expansions of $P_λ$ and $A_{λ+ρ}$, principal specializations of $P_λ$ and $E_μ$, for Macdonald's constant term formulas, and for the norms of Macdonald polynomials. Most of these follow from the creation formulas for Macdonald polynomials, providing alternative proofs to several results from Macdonald (2003). In addition, we prove the Boson-Fermion correspondence in the Macdonald polynomial setting and the Weyl character formula for Macdonald polynomials.
We prove a combinatorial formula for Macdonald cumulants which generalizes the celebrated formula of Haglund for Macdonald polynomials. We provide several applications of our formula. Firstly, it gives a new, constructive proof of a strong factorization property of Macdonald polynomials proven recently by the author of this paper. Moreover it proves that Macdonald cumulants are $q,t$--positive in the monomial and in the fundamental quasisymmetric bases. Furthermore, we use our formula to prove the recent higher-order Macdonald positivity conjecture for the coefficients of the Schur polynomials…
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.
We demonstrate the validity of previously conjectured explicit expressions for the norm and the evaluation of the Macdonald polynomials in superspace. These expressions, which involve the arm-lengths and leg-lengths of the cells in certain Young diagrams, specialize to the well known formulas for the norm and the evaluation of the usual Macdonald polynomials.
The determinantal form of the partition function of the 6-vertex model with domain wall boundary conditions was given by Izergin. It is known that for a special value of the crossing parameter the partition function reduces to a Schur polynomial. Caradoc, Foda and Kitanine computed the partition function of the higher spin generalization of the 6-vertex model. In the present work it is shown that for a special value of the crossing parameter, referred to as the combinatorial point, the partition function reduces to a Macdonald polynomial.
Using vertex operator we study Macdonald symmetric functions of rectangular shapes and their connection with the q-Dyson Laurent polynomial. We find a vertex operator realization of Macdonald functions and thus give a generalized Frobenius formula for them. As byproducts of the realization, we find a q-Dyson constant term orthogonality relation which generalizes a conjecture due to Kadell in 2000, and we generalize Matsumoto's hyperdeterminant formula for rectangular Jack functions to Macdonald functions.
We investigate the connections between various noncommutative analogues of Hall-Littlewood and Macdonald polynomials, and define some new families of noncommutative symmetric functions depending on two sequences of parameters.
We define a family of symmetric polynomials $G_{ν,λ}(z_1,\cdots, z_{n+1},q)$ indexed by a pair of dominant integral weights. The polynomial $G_{ν,0}(z,q)$ is the specialized Macdonald polynomial and we prove that $G_{0,λ}(z,q)$ is the graded character of a level two Demazure module associated to the affine Lie algebra $\widehat{\mathfrak{sl}}_{n+1}$. Under suitable conditions on $(ν,λ)$ (which includes the case when $ν=0$ or $λ=0$) we prove that $G_{ν,λ}(z,q)$ is Schur positive and give explicit formulae for them in terms of Macdonald polynomials.
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_γ(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_λ(X; q, t)$ with the property that $G_γ(X; 0, 0)$ equals $QS_γ(X)$, the quasisymmetric Schur polynomial of [9]. We derive an expansion for $G_γ(X; q, t)$ in the fundamental basis of quasisymmetric functions.
We derive combinatorial formulae for the modified Macdonald polynomial $H_λ(x;q,t)$ using coloured paths on a square lattice with quasi-cylindrical boundary conditions. The derivation is based on an integrable model associated to the quantum group of $U_{q}(\wide{sl}_{n+1})$.
Jack polynomials generalize several classical families of symmetric polynomials, including Schur polynomials, and are further generalized by Macdonald polynomials. In 1989, Richard Stanley conjectured that if the Littlewood-Richardson coefficient for a triple of Schur polynomials is 1, then the corresponding coefficient for Jack polynomials can be expressed as a product of weighted hooks of the Young diagrams associated to the partitions indexing the coefficient. We prove a special case of this conjecture in which the partitions indexing the Littlewood-Richardson coefficient have at most 3 par…
Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the combinatorics of alcove walks to calculate products of monomials and intertwining operators of the double affine Hecke algebra. From this, we obtain a product formula for Macdonald polynomials of general type.
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. We then discuss a family of polynomials called Demazure atoms. We review the known characterizations of these polynomials and then present two new characterizations. Finally, we consider a family of polynomials called permuted basement nonsymmetric Macdonald polynomials which are obtained by permuting the basement of the combinatorial formula of Haglund, Haiman, and Loehr for nonsymmetric Macdonal…
In this paper we derive a counterpart of the well-known Ram-Yip formula for symmetric and nonsymmetric Macdonald polynomials of arbitrary type. Our new formula is in terms of a generalization of the Lakshmibai-Seshadri paths (originating in standard monomial theory), which we call pseudo-quantum Lakshmibai-Seshadri (LS) paths. This model carries less information than the alcove walks in the Ram-Yip formula, and it is therefore more efficient. Furthermore, we construct a connected pseudo-crystal structure on the pseudo-quantum LS paths, which is expected to lead to a simple Littlewood-Richardso…
The non-commutative five-term relation $T_{1,0} T_{0,1} = T_{0,1} T_{1,1} T_{1,0}$ is shown to hold for certain operators acting on symmetric functions. The "generalized recursion" conjecture of Bergeron and Haiman is a corollary of this result.
The clustering properties of Jack polynomials are relevant in the theoretical study of the fractional Hall states. In this context, some factorization properties have been conjectured for the $(q,t)$-deformed problem involving Macdonald polynomials. The present paper is devoted to the proof of this formula. To this aim we use four families of Jack/Macdonald polynomials: symmetric homogeneous, nonsymmetric homogeneous, shifted symmetric and shifted nonsymmetric.
We investigate the homogeneous symmetric Macdonald polynomials $P_λ(\X;q,t)$ for the specialization $t=q^k$. We show an identity relying the polynomials $P_λ(\X;q,q^k)$ and $P_λ(\frac{1-q}{1-q^k}\X;q,q^k)$. As a consequence, we describe an operator whose eigenvalues characterize the polynomials $P_λ(\X;q,q^k)$.
We present explicit Pieri formulas for Macdonald's spherical functions (or generalized Hall-Littlewood polynomials associated with root systems) and their $q$-deformation the Macdonald polynomials. For the root systems of type $A$, our Pieri formulas recover the well-known Pieri formulas for the Hall-Littlewood and Macdonald symmetric functions due to Morris and Macdonald as special cases.
The Knop-Sahi interpolation Macdonald polynomials are inhomogeneous and nonsymmetric generalisations of the well-known Macdonald polynomials. In this paper we apply the interpolation Macdonald polynomials to study a new type of basic hypergeometric series of type g_n. Our main results include a new q-binomial theorem, new q-Gauss sum, and several transformation formulae for g_n series.
We study Macdonald polynomials from a basic hypergeometric series point of view. In particular, we show that the Pieri formula for Macdonald polynomials and its recently discovered inverse, a recursion formula for Macdonald polynomials, both represent multivariable extensions of the terminating very-well-poised 6-phi-5 summation formula. We derive several new related identities including multivariate extensions of Jackson's very-well-poised 8-phi-7 summation. Motivated by our basic hypergeometric analysis, we propose an extension of Macdonald polynomials to Macdonald symmetric functions indexe…
