A Little bijection for affine Stanley symmetric functions
Thomas Lam, Mark Shimozono
TL;DR
This paper extends Little's combinatorial algorithm to affine Stanley symmetric functions, providing new tools to analyze their Schur-positivity and related combinatorial properties.
Contribution
The paper introduces a generalized algorithm for affine Stanley symmetric functions, expanding the combinatorial framework for their study.
Findings
Generalization of Little's algorithm to affine case
Enhanced understanding of Schur-positivity in affine symmetric functions
Potential applications to affine Schubert calculus
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Molecular spectroscopy and chirality · Algebraic structures and combinatorial models