Combinatorial formulas for Macdonald polynomials by superizations
Abstract
In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials Pλ(X;q,t) and non-symmetric Macdonald polynomials Eγ(X;q,t), in terms of several new statistics and the major index, for a partition λ and a weak composition γ. Compared to previous formulas, these new formulas contain the fewest terms and lead to explicit (q,t)-formulas for the coefficients in the monomial expansion of Pλ(X;q,t). In particular, the combinatorial formula for Eγ(X;q,t) extends the one for Eλ(X;q,t) indexed by a partition λ, due to Corteel, Mandelshtam and Williams (2022). Three existing formulas for Pλ(X;q,t) established by Corteel, Mandelshtam and Williams (2022), by Corteel, Haglund, Mandelshtam, Mason and Williams (2022), and by Mandelshtam (2025) are recovered. Our proof relies on two new statistics on super fillings, employing the superization formulas of Haglund--Haiman--Loehr (2005) and Ayyer--Mandelshtam--Martin (2023), together with our recent approach to modified Macdonald polynomials.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.