Papers
Topics
Authors
Recent
Search
2000 character limit reached

Affine Demazure crystals for specialized nonsymmetric Macdonald polynomials

Published 11 Feb 2020 in math.CO and math.RT | (2002.04141v3)

Abstract: We give a crystal-theoretic proof that nonsymmetric Macdonald polynomials specialized to $t=0$ are affine Demazure characters. We explicitly construct an affine Demazure crystal on semistandard key tabloids such that removing the affine edges recovers the finite Demazure crystals constructed earlier by the authors. We also realize the filtration on highest weight modules by Demazure modules by defining explicit embedding operators which, at the level of characters, parallels the recursion operators of Knop and Sahi for specialized nonsymmetric Macdonald polynomials. Thus we prove combinatorially in type A that every affine Demazure module admits a finite Demazure flag.

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 (2)

Collections

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