2000 character limit reached
Saturation for Non-Symmetric Macdonald Polynomials
Published 1 Aug 2025 in math.CO | (2508.00336v1)
Abstract: We prove that supports of non-symmetric Macdonald polynomials are $M$-convex. As a consequence, we resolve a 2019 conjecture of Monical, Tokcan, and Yong that they have the saturated Newton polytope property. As a further consequence, we prove that the moment polytopes of affine Schubert varieties in the affine Grassmannian of type $\mathrm{GL}$ are generalized permutahedra.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.