Saturation for Non-Symmetric Macdonald Polynomials
Combinatorics
2026-03-24 v2
Abstract
We prove that supports of non-symmetric Macdonald polynomials are -convex. As a consequence, we resolve a 2019 conjecture of Monical, Tokcan, and Yong that they have the saturated Newton polytope property. As a corollary we show that affine Demazure characters of type have M-convex supports and therefore the saturated Newton polytope property answering a 2022 open question of Besson and Hong. By their results, we then find that certain affine analogs of Bruhat interval polytopes in type are generalized permutahedra. To prove these results, we find a novel interpretation of the Haglund--Haiman--Loehr formula for non-symmetric Macdonald polynomials in terms of colorings of Dyck graphs.
Keywords
Cite
@article{arxiv.2508.00336,
title = {Saturation for Non-Symmetric Macdonald Polynomials},
author = {Milo Bechtloff Weising and Alexander E. Black},
journal= {arXiv preprint arXiv:2508.00336},
year = {2026}
}
Comments
25 pages; restructured and added several new results