A Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm
Combinatorics
2009-04-02 v4
Abstract
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.
Keywords
Cite
@article{arxiv.math/0604430,
title = {A Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm},
author = {Sarah Mason},
journal= {arXiv preprint arXiv:math/0604430},
year = {2009}
}
Comments
24 pages; restructured; see journal for comment on connections to Demazure characters