A Little bijection for affine Stanley symmetric functions
Combinatorics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.math/0601483,
title = {A Little bijection for affine Stanley symmetric functions},
author = {Thomas Lam and Mark Shimozono},
journal= {arXiv preprint arXiv:math/0601483},
year = {2007}
}
Comments
10 pages