A Little bijection for affine Stanley symmetric functions
From MaRDI portal
Publication:2654582
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.
Recommendations
Cited in
(9)- On some actions of the 0-Hecke monoids of affine symmetric groups
- Transition formulas for involution Schubert polynomials
- Quasiparabolic sets and Stanley symmetric functions for affine fixed-point-free involutions
- On some properties of symplectic Grothendieck polynomials
- \(P\)-partition products and fundamental quasi-symmetric function positivity
- Coxeter-Knuth graphs and a signed little map for type B reduced words
- A bijective proof of Macdonald's reduced word formula
- Schubert polynomials for the affine Grassmannian
- Stanley symmetric functions for signed involutions
This page was built for publication: A Little bijection for affine Stanley symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654582)