Papers
Topics
Authors
Recent
2000 character limit reached

Nonsymmetric Macdonald polynomials and a refinement of Kostka-Foulkes polynomials

Published 7 Mar 2017 in math.CO and math.RT | (1703.02466v2)

Abstract: We study the specialization of the type A nonsymmetric Macdonald polynomials at $t=0$ based on the combinatorial formula of Haglund, Haiman, and Loehr. We prove that this specialization expands nonnegatively into the fundamental slide polynomials, introduced by the author and Searles. Using this and weak dual equivalence, we prove combinatorially that this specialization is a positive graded sum of Demazure characters. We use stability results for fundamental slide polynomials to show that this specialization stabilizes and to show that the Demazure character coefficients give a refinement of the Kostka--Foulkes polynomials.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.