arXiv:math/0601483 [math.CO]AbstractReferencesReviewsResources
A Little bijection for affine Stanley symmetric functions
Published 2006-01-19Version 1
David Little developed a combinatorial algorithm to study the Schur-positivity of Stanley symmetric functions and the Lascoux-Sch\"{u}tzenberger tree. We generalize this algorithm to affine Stanley symmetric functions.
Related articles: Most relevant | Search more
arXiv:1111.3312 [math.CO] (Published 2011-11-14)
Affine Stanley symmetric functions for classical types
Necessary Conditions for Schur-Positivity
arXiv:2012.01885 [math.CO] (Published 2020-12-03)
A domino tableau-based view on type B Schur-positivity