A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by explaining how the Ram-Yip formula compresses to a new formula, which is similar to the Haglund-Haiman-Loehr one but contains considerably fewer terms.
In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GL(n). At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms of the Littelmann path model (in the positively folded gallery form of Gaussent-Littelmann).
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.
A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of the corresponding affine Weyl group. In this paper, we show that a Haglund-Haiman-Loehr type formula follows naturally from the more general Ram-Yip formula, via compression. Then we extend this approach to the Hall-Littlewood polynomials of type C, which are specializations of the corresponding Macdon…
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 make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon tableaux which we transform into a dual equivalence graph, we give a combinatorial proof of the symmetry and Schur positivity of the ribbon tableaux generating functions introduced by Lascoux, Leclerc and Thibon. Using Haglund's formula for the transformed Macdonald polynomials, this also gives a combinatorial formula for the Schur expansion of Macdonald polynomial…
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatorial tools to describe the formula in a purely combinatorial way for type A_n, B_n and C_n. This description is in terms of Young tableaux and arises from identifying one-skeleton galleries that appear in the Gaussent-Littelmann formula with Young tableaux. Furthermore, we show by using these tools that the Gaussent-Littelmann formula and the well-known Macdonald formula for Hall-Littlewood polynomials for type A_n are the same.
Sahi, Stokman, and Venkateswaran have constructed, for each positive integer $n$, a family of Laurent polynomials depending on parameters $q$ and $k$ (in addition to $\lfloor n/2\rfloor$ "metaplectic parameters"), such that the $n=1$ case recovers the nonsymmetric Macdonald polynomials and the $q\rightarrow\infty$ limit yields metaplectic Iwahori-Whittaker functions with arbitrary Gauss sum parameters. In this paper, we study these new polynomials, which we call SSV polynomials, in the case of $GL_r$. We apply a result of Ram and Yip in order to give a combinatorial formula for the SSV polynom…
We study the specialization of the type A nonsymmetric Macdonald polynomials at $t=0$ based on the combinatorial formula of Haglund, Haiman, and Loehr. We prove that this specialization expands nonnegatively into the fundamental slide polynomials, introduced by the author and Searles. Using this and weak dual equivalence, we prove combinatorially that this specialization is a positive graded sum of Demazure characters. We use stability results for fundamental slide polynomials to show that this specialization stabilizes and to show that the Demazure character coefficients give a refinement of …
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…
Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_μ(\mathbf{x};q,t) = \widetilde{H}_{μ^\ast}(\mathbf{x};t,q)$. We provide a purely combinatorial proof of the relation in the case of Hall-Littlewood polynomials ($q=0$) when $μ$ is a partition with at most three rows, and for the coefficients of the square-free monomials in $\mathbf{x}$ for all shapes $μ$. We also provide a proof for the full relation in the case when $μ$ is a hook shape, and for all shapes at the speci…
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.
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.
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…
In this work we study the relationship between several combinatorial formulas for type $A$ spherical Whittaker functions. These are spherical functions on $p$-adic groups, which arise in the theory of automorphic forms. They depend on a parameter $t$, and are a specialization of Macdonald polynomials, and further specialize to Schur polynomials upon setting $t=0$. There are three types of formulas for these polynomials. The first formula is in terms of so-called alcove walks, works in arbitrary Lie type, and is derived from the Ram-Yip formula for Macdonald polynomials. The second one is in te…
Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present combinatorial formulas for the well poised Macdonald functions, the multiple binomial coefficients, the multiple bracket function, and the multiple Catalan and Lah numbers.
We give a crystal-theoretic proof that nonsymmetric Macdonald polynomials specialized to $t=0$ are affine Demazure characters. We explicitly construct an affine Demazure crystal on semistandard key tabloids such that removing the affine edges recovers the finite Demazure crystals constructed earlier by the authors. We also realize the filtration on highest weight modules by Demazure modules by defining explicit embedding operators which, at the level of characters, parallels the recursion operators of Knop and Sahi for specialized nonsymmetric Macdonald polynomials. Thus we prove combinatorial…
We give an explicit, nonnegative formula for the expansion of nonsymmetric Macdonald polynomials specialized at $t=0$ in terms of Demazure characters. Our formula results from constructing Demazure crystals whose characters are the nonsymmetric Macdonald polynomials, which also gives a new proof that these specialized nonsymmetric Macdonald polynomials are positive graded sums of Demazure characters. Demazure crystals are certain truncations of classical crystals that give a combinatorial skeleton for Demazure modules. To prove our construction, we develop further properties of Demazure crysta…
This paper surveys eight classes of polynomials associated with $A$-type and $BC$-type root systems: Jack, Jacobi, Macdonald and Koornwinder polynomials and interpolation (or shifted) Jack and Macdonald polynomials and their $BC$-type extensions. Among these the $BC$-type interpolation Jack polynomials were probably unobserved until now. Much emphasis is put on combinatorial formulas and binomial formulas for (most of) these polynomials. Possibly new results derived from these formulas are a limit from Koornwinder to Macdonald polynomials, an explicit formula for Koornwinder polynomials in two…
We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum of monomials in Lam's algebra of ribbon Schur operators. Combining this result with the expression of Haglund, Haiman, and Loehr for transformed Macdonald polynomials in terms of LLT polynomials then yields a positive combinatorial rule for transformed Macdonald polynomials indexed by a shape with 3 columns.
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 walk formula and the nonattacking fillings formulas for type $GL_n$ Macdonald polynomials we did many examples and significant analysis of the literature. In the preparation of Guo-Ram arXiv:2104.02942 it seemed sensible to produce a document with focus and this material was removed. This is paper resurrects and organizes that material, in hopes that others m…
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 explicit Pieri formula for the Macdonald polynomials in question. The simplest examples of our construction recover Macdonald's celebrated difference operators and associated Pieri formulas pertaining to the minuscule and quasi-minuscule weights. As further by-products, explicit expansions and Littlewood-Richardson type formulas are obtained for the Macdonald polyn…
The paper compares (and reproves) the alcove walk and the nonattacking fillings formulas for type $GL_n$ Macdonald polynomials which were given in Haglund-Haiman-Loehr arXiv:math.CO/0601693, Alexandersson arXiv:1602.05153 and Ram-Yip arXiv:0803.1146. The "compression" relating the two formulas in this paper is the same as that of Lenart arXiv:0804.4716. We have reformulated it so that it holds without conditions and so that the proofs of the alcove walk formula and the nonattacking fillings formula are parallel. This reformulation highlights the role of the double affine Hecke algebra and Cher…
The charge is an intricate statistic on words, due to Lascoux and Schutzenberger, which gives positive combinatorial formulas for Lusztig's q-analogue of weight multiplicities and the energy function on affine crystals, both of type A. As these concepts are defined for all Lie types, it has been a long-standing problem to express them based on a generalization of charge. I present a method for addressing this problem in classical Lie types, based on the recent Ram-Yip formula for Macdonald polynomials and the quantum Bruhat order on the corresponding Weyl group. The details of the method are c…
Starting from an integrable rank-$n$ vertex model, we construct an explicit family of partition functions indexed by compositions $μ= (μ_1,\dots,μ_n)$. Using the Yang-Baxter algebra of the model and a certain rotation operation that acts on our partition functions, we show that they are eigenfunctions of the Cherednik-Dunkl operators $Y_i$ for all $1 \leq i \leq n$, and are thus equal to nonsymmetric Macdonald polynomials $E_μ$. Our partition functions have the combinatorial interpretation of ensembles of coloured lattice paths which traverse a cylinder. Applying a simple bijection to such pat…
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.
We give a direct geometric interpretation of the path model using galleries in the $1-$skeleton of the Bruhat-Tits building associated to a semi-simple algebraic group. This interpretation allows us to compute the coefficients of the expansion of the Hall-Littlewood polynomials in the monomial basis. The formula we obtain is a "geometric compression" of the one proved by Schwer, its specialization to the case ${\tt A}_n$ turns out to be equivalent to Macdonald's formula.
In this paper we give Monk rules for Macdonald polynomials which are analogous to the Monk rules for Schubert polynomials. These formulas are similar to the formulas given by Baratta (2008), but our method of derivation is to use Cherednik's interwiners. Deriving Monk rules by this technique addresses the relationship between the work of Baratta and the product formulas of Yip (2010). Specializations of the Monk formula's at $q=0$ and/or $t=0$ provide Monk rules for Iwahori-spherical polynomials and for finite and affine key polynomials.
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.
We find and prove a factorization formula for certain Macdonald Littlewood-Richardson coefficients $c_{λμ}^ν(q,t)$. Namely, we consider the case that the Kostka number $K_{μ, ν-λ}$ is $1$. This settles a particular case of a more general conjecture of Richard Stanely. This conjecture proposes that a factorization formula exists whenever the corresponding regular Littlewood-Richardson coefficient $c^ν_{λμ}$ is $1$.
In a seminal paper Richard Stanley derived Pieri rules for the Jack symmetric function basis. These rules were extended by Macdonald to his now famous symmetric function basis. The original form of these rules had a forbidding complexity that made them difficult to use in explicit calculations. In the early 90's it was discovered that, due to massive cancellations, the dual rule, which expresses skewing by $e_1$ the modified Macdonald polynomial ${\tilde H}_μ[X;q,t]$, can be given a very simple combinatorial form in terms of corner weights of the Ferrers' diagram of $μ$. A similar formula was …
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.
Recently James Martin introduced multiline queues, and used them to give a combinatorial formula for the stationary distribution of the multispecies asymmetric simple exclusion exclusion process (ASEP) on a circle. The ASEP is a model of particles hopping on a one-dimensional lattice, which was introduced around 1970, and has been extensively studied in statistical mechanics, probability, and combinatorics. In this article we give an independent proof of Martin's result, and we show that by introducing additional statistics on multiline queues, we can use them to give a new combinatorial formu…
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.
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 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 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})$.
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 Schubert polynomials in the deformation parameters.
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.
This paper gives bijective proofs of some novel coinversion identities first discovered by Ayyer, Mandelshtam, and Martin (arxiv:2011.06117) as part of their proof of a new combinatorial formula for the modified Macdonald polynomials $\tilde{H}_μ$. Those authors used intricate algebraic manipulations of $q$-binomial coefficients to prove these identities, which imply the existence of certain bijections needed in their proof that their formula satisfies the axioms characterizing $\tilde{H}_μ$. They posed the open problem of constructing such bijections explicitly. We resolve that problem here.
Certain triples of power series, considered by I. Macdonald, give a natural framework for many combinatorial and number theoretic sequences, such as the Stirling, Bernoulli and harmonic numbers and partitions of different kinds. The power series in such a triple are closely linked by identities coming from the theory of symmetric functions. We extend the work of Z-H. Sun, who developed similar ideas, and Macdonald, revealing more of the structure of these triples. De Moivre polynomials play a key role in this study.
We extend the family non-symmetric Macdonald polynomials and define general-basement Macdonald polynomials. We show that these also satisfy a triangularity property with respect to the monomials bases and behave well under the Demazure-Lusztig operators. The symmetric Macdonald polynomials $J_λ$ are expressed as a sum of general-basement Macdonald polynomials via an explicit formula. By letting $q=0$, we obtain $t$-deformations of key polynomials and Demazure atoms and we show that the Hall--Littlewood polynomials expand positively into these. This generalizes a result by Haglund, Luoto, Mason…
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…
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some transformation formulas for the basic hypergeometric series involving very well-poised balanced ${}_{12}W_{11}$ series. We remark that the correlation functions of the deformed $\mathcal{W}$ algebra generators automatically give rise to the tableau formulas when we principally specialize the coordinate variables.
We introduce Macdonald polynomials indexed by $n$-tuples of partitions and characterized by certain orthogonality and triangularity relations. We prove that they can be explicitly given as products of ordinary Macdonald polynomials depending on special alphabets. With this factorization in hand, we establish their most basic properties, such as explicit formulas for their norm-squared, evaluation and reproducing kernel. Moreover, we show that the $q,t$-Kostka coefficients associated to the multi-Macdonald polynomials are positive and correspond to $q,t$-analogs of the dimensions of the irreduc…
We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik--Zamolodchikov equations, which arise by considering representations of the Zamolodchikov--Faddeev and Yang--Baxter algebras in terms of $t$-deformed bosonic operators. These solutions form a basis of the ring of polynomials in $n$ variables, whose elements are indexed by compositions. For weakly increasing compositions (anti-dominant weights), these basis elements coincide with non-symmetric Macdonald polynomials. Our formulas imply a natur…
