arXiv:math/0604430 [math.CO]AbstractReferencesReviewsResources
A Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm
Published 2006-04-19, updated 2009-04-02Version 4
We 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.
Comments: 24 pages; restructured; see journal for comment on connections to Demazure characters
Journal: S\'eminaire Lotharingien de Combinatoire, 60 (2008), Art. B57e, 24pp
Categories: math.CO
Keywords: robinson-schensted-knuth algorithm, semi-skyline augmented fillings, decomposition, semi-standard young tableaux, schur functions decompose
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1805.00351 [math.CO] (Published 2018-05-01)
Decomposition of tensor products of Demazure crystals
arXiv:1711.08737 [math.CO] (Published 2017-11-23)
The decomposition of 0-Hecke modules associated to quasisymmetric Schur functions
arXiv:1906.01125 [math.CO] (Published 2019-06-03)
A combinatorial model for the decomposition of multivariate polynomials rings as an $S_n$-module