A Little bijection for affine Stanley symmetric functions
classification
🧮 math.CO
keywords
functionsstanleysymmetricaffinealgorithmlittlebijectioncombinatorial
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.