A Little bijection for affine Stanley symmetric functions
arXiv:math/0601483
Abstract
David Little developed a combinatorial algorithm to study the Schur-positivity of Stanley symmetric functions and the Lascoux-Schützenberger tree. We generalize this algorithm to affine Stanley symmetric functions.
10 pages