A Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.