Combinatorial formulas for Macdonald polynomials by superizations
arXiv:2602.12672
Abstract
In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials and non-symmetric Macdonald polynomials , 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 -formulas for the coefficients in the monomial expansion of . In particular, the combinatorial formula for extends the one for indexed by a partition , due to Corteel, Mandelshtam and Williams (2022). Three existing formulas for 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.
47 pages, 16 figures; The (q,t)-formula for symmetric Macdonald Polynomials and the combinatorial formula for non-symmetric Macdonald Polynomials are added