Combinatorial formulas for symmetric Macdonald polynomials by superizations
Emma Yu Jin, Xiaowei Lin
TL;DR
This work advances the combinatorial understanding of Macdonald polynomials by developing new formulas for $P_{\lambda}(X;q,t)$ and $J_{\lambda}(X;q,t)$ through a refined superization framework. Central to the approach are the quadruple coinversion statistic $\overline{\mathsf{quadcoinv}}$ and its complements, together with flip operators and positive distinguished subexpressions that align major index with these statistics across non-attacking fillings. The authors establish key equidistribution results, derive explicit sum-product formulas, and recover multiple existing Macdonald formulas as special cases, including Lenart’s distinct-part case, via unified combinatorial machinery. They also present alternative proofs (via coinv$'$ and mixinv perspectives) and outline a broader sixteen-statistic landscape $\mathcal{A}$, illustrating deep connections to modified Macdonald polynomials, multiline queues, and qKZ theory. The results offer a unified, flexible toolkit for Macdonald combinatorics with potential implications for representation theory and algebraic geometry.
Abstract
In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials $P_λ(X;q,t)$ and integral Macdonald polynomials $J_λ(X;q,t)$, in terms of several new statistics and the major index for a partition $λ$. Moreover, three existing formulas for symmetric Macdonald polynomials established by Corteel--Mandelshtam--Williams (2022), Corteel--Haglund--Mandelshtam--Mason--Williams (2022) and Mandelshtam (2025) are recovered. Our proof relies on a new statistic on super fillings, employing the superization formula of Ayyer--Mandelshtam--Martin (2023) and our recent approach to modified Macdonald polynomials.
