A Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm

Simple item page
dc.creatorMason, Sarah
dc.date2006-04-19
dc.date2009-04-02
dc.date.accessioned2026-07-07T12:59:12Z
dc.date.available2026-07-07T12:59:12Z
dc.descriptionWe exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The insertion procedure involved in the proof leads to an analogue of the Robinson-Schensted-Knuth Algorithm for semi-skyline augmented fillings. This procedure commutes with the RSK algorithm, and therefore retains many of its properties.
dc.description24 pages; restructured; see journal for comment on connections to Demazure characters
dc.identifierhttps://arxiv.org/abs/math/0604430
dc.identifierhttp://arxiv.org/abs/math/0604430
dc.identifierSéminaire Lotharingien de Combinatoire, 60 (2008), Art. B57e, 24pp
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225500
dc.subjectCombinatorics
dc.subject05E05; 05E10
dc.titleA Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm
dc.typetext

Files

Collections

arXiv