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 Macdonald polynomials at q=0. We note that no analog of the Haglund-Haiman-Loehr formula exists beyond type A, so our work is a first step towards finding such a formula.
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$.
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 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.
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.
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 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.
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…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of bounded Littlewood identities for Macdonald polynomials. These identities, which take the form of decomposition formulas for Macdonald polynomials of type $(R,S)$ in terms of ordinary Macdonald polynomials, are $q,t$-analogues of known branching formulas for characters of the symplectic, orthogonal and special orthogonal groups. In the classical limit, our me…
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 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 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.
Koornwinder polynomials are a 6-parameter BC_n-symmetric family of Laurent polynomials indexed by partitions, from which Macdonald polynomials can be recovered in suitable limits of the parameters. As in the Macdonald polynomial case, standard constructions via difference operators do not allow one to directly control these polynomials at q=0. In the first part of this paper, we provide an explicit construction for these polynomials in this limit, using the defining properties of Koornwinder polynomials. Our formula is a first step in developing the analogy between Hall-Littlewood polynomials …
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…
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…
The ring of symmetric functions $Λ$, 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 $Λ$ 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 the co-product in the Schur basis. In the first part of this thesis we show that by using a generalization of the classical umbral cal…
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 for monomial, Jack and Hall-Littlewood symmetric functions.
In a recent paper Konvalinka and Lauve proved several skew Pieri rules for Hall-Littlewood polynomials. In this note we show that q-analogues of these rules are encoded in a q-binomial theorem for Macdonald polynomials due to Lascoux and the author.
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$, we recover known expressions for the monomial symmetric and Hall-Littlewood polynomials, respectively. Other specializations of our formula give new expressions for the Jack and $q$-Whittaker polynomials.
In previous work we showed that two apparently unrelated formulas for the Hall-Littlewood polynomials of type A are, in fact, closely related. The first is the tableau formula obtained by specializing q=0 in the Haglund-Haiman-Loehr formula for Macdonald polynomials. The second is the type $A$ instance of Schwer's formula (rephrased and rederived by Ram) for Hall-Littlewood polynomials of arbitrary finite type; Schwer's formula is in terms of so-called alcove walks, which originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann pa…
We prove analogues for elliptic interpolation functions of Macdonald's version of the Littlewood identity for (skew) Macdonald polynomials, in the process developing an interpretation of general elliptic "hypergeometric" sums as skew interpolation functions. One such analogue has an interpretation as a "vanishing integral", generalizing a result of arXiv:math/0606204; the structure of this analogue gives sufficient insight to enable us to conjecture elliptic versions of most of the other vanishing integrals of arXiv:math/0606204 as well. We are thus led to formulate ten conjectures, each of wh…
We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees. We conjecture a simple form for the norm of the Macdonald polynomials in superspace, and a rather non-trivial expression for their evaluation. We study the limiting cases q=0 and q=\infty, which lead to two families of Hall-Littlewood polynomials in superspace. We also find that the Macdonald polynomials in superspace evaluated at q=t=0 or q=t=\infty seem to generalize naturally the…
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…
We construct a family of pairwise commuting operators such that the Macdonald symmetric functions of infinitely many variables $x_1,x_2,...$ and of two parameters $q,t$ are their eigenfunctions. These operators are defined as limits at $N\to\infty$ of renormalised Macdonald operators acting on symmetric polynomials in the variables $x_1,...,x_N$. They are differential operators in terms of the power sum variables $p_n=x_1^n+x_2^n+...$ and we compute their symbols by using the Macdonald reproducing kernel. We express these symbols in terms of the Hall-Littlewood symmetric functions of the varia…
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…
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. The inversion statistic, which is the more intricate one, suffices for specializing a closely related formula to one for the type A Hall-Littlewood Q-polynomials (spherical functions on p-adic groups). An apparently unrelated development, at the level of arbitrary finite root systems, led to Schwer's formula (rephrased and rederived by Ram) for the Hall-Littlewood P-…
Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics. This paper attempts to organize the different definitions of these objects and prove the fundamental combinatorial results from ``scratch'', in a presentation which, hopefully, will be accessible and useful for both the nonexpert and researchers currently working in this very active field. The combinatorics of the affine Hecke algebra plays a central role. …
It is well known that if one integrates a Schur function indexed by a partition $λ$ over the symplectic (resp. orthogonal) group, the integral vanishes unless all parts of $λ$ have even multiplicity (resp. all parts of $λ$ are even). In a recent paper of Rains and Vazirani, Macdonald polynomial generalizations of these identities and several others were developed and proved using Hecke algebra techniques. However at $q=0$ (the Hall-Littlewood level), these approaches do not work, although one can obtain the results by taking the appropriate limit. In this paper, we develop a direct approach fo…
We use Young's raising operators to derive a Pieri rule for the ring generated by the indeterminates $h_{r,s}$ given in Macdonald's 9th Variation of the Schur functions. Under an appropriate specialisation of $h_{r,s}$, we derive the Pieri rule for the ring $\La(a)$ of double symmetric functions, which has a basis consisting of the double Schur functions. Together with a suitable interpretation of the Jacobi--Trudi identity, our Pieri rule allows us to obtain a new proof of a rule to calculate the Littlewood--Richardson polynomials, which gives a multiplication rule for the double Schur functi…
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 definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on the type-$A$ affine Weyl group. We construct two one-parameter families of functions that respectively transition positively with Hall-Littlewood and Macdonald's $P$-functions, and specialize to the representatives for Schubert classes of homology and cohomology of the affine Grassmannian. Our approach leads us to conjecture that all elements in a defining …
The non-negative integer cocharge statistic on words was introduced in the 1970's by Lascoux and Schützenberger to combinatorially characterize the Hall-Littlewood polynomials. Cocharge has since been used to explain phenomena ranging from the graded decomposition of Garsia-Procesi modules to the cohomology structure of the Grassman variety. Although its application to contemporary variations of these problems had been deemed intractable, we prove that the two-parameter, symmetric Macdonald polynomials are generating functions of a distinguished family of colored words. Cocharge adorns one par…
This paper uses the theory of dual equivalence graphs to give explicit Schur expansions for several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified Hall-Littlewood polynomials indexed by any diagram $δ\subset {\mathbb Z} \times {\mathbb Z}$, written as $\widetilde H_δ(X;q,t)$ and $\widetilde H_δ(X;0,t)$, respectively. We then give an explicit Schur expansion of $\widetilde H_δ(X;0,t)$ as a sum over a subset of the Yamanouchi words, as opposed to the expansion using the charge statistic given in 1978 by Lascoux an…
For any homomorphism V on the space of symmetric functions, we introduce an operation which creates a q-analog of V. By giving several examples we demonstrate that this quantization occurs naturally within the theory of symmetric functions. In particular, we show that the Hall-Littlewood symmetric functions are formed by taking this q-analog of the Schur symmetric functions and the Macdonald symmetric functions appear by taking the q-analog of the Hall-Littlewood symmetric functions in the parameter t. This relation is then used to derive recurrences on the Macdonald q,t-Kostka coefficients.
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$ and $t$, and the correspondence gives a new proof of the squarefree part of the Cauchy identity for Macdonald polynomials. By specializing $q$ and $t$ in various ways, one recovers both the row and column insertion versions of the Robinson--Schensted correspondence, as well as several $q$- and $t$-deformations of row and column insertion which have been intro…
The Weyl-Kac character formula gives a beautiful closed-form expression for the characters of integrable highest-weight modules of Kac-Moody algebras. It is not, however, a formula that is combinatorial in nature, obscuring positivity. In this paper we show that the theory of Hall-Littlewood polynomials may be employed to prove Littlewood-type combinatorial formulas for the characters of certain highest weight modules of the affine Lie algebras C_n^{(1)}, A_{2n}^{(2)} and D_{n+1}^{(2)}. Through specialisation this yields generalisations for B_n^{(1)}, C_n^{(1)}, A_{2n-1}^{(2)}, A_{2n}^{(2)} an…
We introduce a randomized Hall-Littlewood RSK algorithm and study its combinatorial and probabilistic properties. On the probabilistic side, a new model --- the Hall-Littlewood RSK field --- is introduced. Its various degenerations contain known objects (the stochastic six vertex model, the asymmetric simple exclusion process) as well as a variety of new ones. We provide formulas for a rich class of observables of these models, extending existing results about Macdonald processes. On the combinatorial side, we establish analogs of properties of the classical RSK algorithm: invertibility, symme…
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.
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 present an explicit formula for the transition matrix $\mathcal{C}$ from the type $C_n$ degeneration of the Koornwinder polynomials $P_{(1^r)}(x\,|\,a,-a,c,-c\,|\,q,t)$ with one column diagrams, to the type $C_n$ monomial symmetric polynomials $m_{(1^{r})}(x)$. The entries of the matrix $\mathcal{C}$ enjoy a set of three term recursion relations, which can be regarded as a $(a,c,t)$-deformation of the one for the Catalan triangle or ballot numbers. Some transition matrices are studied associated with the type $(C_n,C_n)$ Macdonald polynomials $P^{(C_n,C_n)}_{(1^r)}(x\,|\,b;q,t)= P_{(1^r)}\b…
The branching rule is one of the most fundamental properties of the Macdonald symmetric polynomials. It expresses a Macdonald polynomial as a nonnegative linear combination of Macdonald polynomials with smaller number of variables. Taking a limit of the branching rule under the principal specialization when the number of variables goes to infinity, we obtain a Markov chain of $m$ noncolliding particles with negative drift and an absorbing wall at zero. The chain depends on the Macdonald parameters $(q,t)$ and may be viewed as a discrete deformation of the Dyson Brownian motion. The trajectory …
MacMahon's classic generating function of random plane partitions, which is related to Schur polynomials, was recently extended by Vuletic to a generating function of weighted plane partitions that is related to Hall-Littlewood polynomials, S(t), and further to one related to Macdonald polynomials, S(t,q). Using Jing's 1-parameter deformation of charged free fermions, we obtain a Fock space derivation of the Hall-Littlewood extension. Confining the plane partitions to a finite s-by-s square base, we show that the resulting generating function, S_{s-by-s}(t), is an evaluation of a tau-function …
For any Schur function $s_ν$, the associated {\em delta operator} $Δ'_{s_ν}$ is a linear operator on the ring of symmetric functions which has the modified Macdonald polynomials as an eigenbasis. When $ν= (1^{n-1})$ is a column of length $n-1$, the symmetric function $Δ'_{e_{n-1}} e_n$ appears in the Shuffle Theorem of Carlsson-Mellit. More generally, when $ν= (1^{k-1})$ is any column the polynomial $Δ'_{e_{k-1}} e_n$ is the symmetric function side of the Delta Conjecture of Haglund-Remmel-Wilson. We give an expansion of $ωΔ'_{s_ν} e_n$ at $t = 0$ in the dual Hall-Littlewood basis for any part…
A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a Littlewood-Richardson coefficient is non-zero if and only if it satisfies a collection of Horn inequalities which are indexed by smaller non-zero Littlewood-Richardson coefficients. There are similar Littlewood-Richardson numbers for Schur P- and Q- functions. Using a mixture of combinatorics of root systems, combinatorial linear algebra in Lie algebras, and the geometry of certain cominuscule flag varieties, we give Horn recursions to determi…
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$ and $t$, and the correspondence gives a new proof of the squarefree part of the Cauchy identity for Macdonald polynomials (i.e., the equality of the coefficients of $x_1 \cdots x_n y_1 \cdots y_n$ on either side, which are related to permutations and standard Young tableaux). By specializing $q$ and $t$ in various ways, one recovers the row and column inserti…
Macdonald superpolynomials provide a remarkably rich generalization of the usual Macdonald polynomials. The starting point of this work is the observation of a previously unnoticed stability property of the Macdonald superpolynomials when the fermionic sector m is sufficiently large: their decomposition in the monomial basis is then independent of m. These stable superpolynomials are readily mapped into bisymmetric polynomials, an operation that spoils the ring structure but drastically simplifies the associated vector space. Our main result is a factorization of the (stable) bisymmetric Macdo…
Let $Λ$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_λ[X/(1-t)]\}_{λ_1\leq k}$. We introduce a new family of symmetric polynomials, $\{A_λ^{(k)}[X;t]\}_{λ_1\leq k}$, constructed from sums of tableaux using the charge statistic. We conjecture that the polynomials $A_λ^{(k)}[X;t]$ form a basis for $V_k$ and that the Macdonald polynomials indexed by partitions whose first part is not larger than $k$ expand positively in terms of our polynomials. A proof of this conjecture would not only imply the Macdonald positivity conjecture, but wo…
This note is an extended abstract of my talk at the workshop on Representation Theory and Symmetric Functions, MSRI, April 14, 1997. We discuss the problem of finding an explicit description of the semigroup $LR_r$ of triples of partitions of length $\leq r$ such that the corresponding Littlewood-Richardson coefficient is non-zero. After discussing the history of the problem and previously known results, we suggest a new approach based on the ``polyhedral'' combinatorial expressions for the Littlewood-Richardson coefficients.
We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure atoms. Our new basis is called the basis of quasisymmetric Schur functions, since the basis elements refine Schur functions in a natural way. We derive expansions for quasisymmetric Schur functions in terms of monomial and fundamental quasisymmetric functions, which give rise to quasisymmetric refinements of Kostka numbers and standard (reverse) tableaux. From here we derive a Pieri rule for quasisymmetric Schur functions that …
In 2008, Han rediscovered an expansion of powers of Dedekind $η$ function attributed to Nekrasov and Okounkov (which was actually first proved the same year by Westbury) by using a famous identity of Macdonald in the framework of type $\widetilde{A}$ affine root systems. In this paper, we obtain new combinatorial expansions of powers of $η$, in terms of partition hook lengths, by using the Macdonald identity in type $\widetilde{C}$ and a new bijection between vectors with integral coordinates and a subset of $t$-cores for integer partitions. As applications, we derive a symplectic hook formula…
