A Little bijection for affine Stanley symmetric functions

Simple item page
dc.creatorLam, Thomas
dc.creatorShimozono, Mark
dc.date2006-01-19
dc.date.accessioned2026-07-07T06:59:06Z
dc.date.available2026-07-07T06:59:06Z
dc.descriptionDavid 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0601483
dc.identifierhttp://arxiv.org/abs/math/0601483
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107624
dc.subjectCombinatorics
dc.subject05E05
dc.titleA Little bijection for affine Stanley symmetric functions
dc.typetext

Files

Collections

arXiv