In this paper we prove a new combinatorial formula for the modified Macdonald polynomials $\widetilde{H}_λ(X;q,t)$, motivated by connections to the theory of interacting particle systems from statistical mechanics. The formula involves a new statistic called queue inversions on fillings of tableaux. This statistic is closely related to the multiline queues which were recently used to give a formula for the Macdonald polynomials $P_λ(X;q,t)$. In the case $q=1$ and $X=(1,1,\dots,1)$, that formula had also been shown to compute stationary probabilities for a particle system known as the multispecies ASEP on a ring, and it is natural to ask whether a similar connection exists between the modified Macdonald polynomials and a suitable statistical mechanics model. In a sequel to this work, we demonstrate such a connection, showing that the stationary probabilities of the multispecies totally asymmetric zero-range process (mTAZRP) on a ring can be computed using tableaux formulas with the queue inversion statistic. This connection extends to arbitrary $X=(x_1,\dots, x_n)$; the $x_i$ play the role of site-dependent jump rates for the mTAZRP.
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…
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 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.
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 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})$.
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.
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.
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.
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.
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…
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…
Exploiting the fact that the $q$-Whittaker polynomials arise as a specialization of the (modified) Macdonald polynomials, we derive some of their basic properties, and explore interesting identities that they satisfy. We also show how they arise as graded Frobenius characteristics of $§_n$-modules, and give a combinatorial approach to associated Pieri formulas.
