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.

arXiv comment24 pages; restructured; see journal for comment on connections to Demazure characters

Cited by in corpus (16)

• Quasisymmetric Schur functions
• Skew quasisymmetric Schur functions and noncommutative Schur functions
• Set-Valued Skyline Fillings
• Colored five-vertex models and Lascoux polynomials and atoms
• Non-symmetric Macdonald polynomials and Demazure-Lusztig operators
• Row-strict Quasisymmetric Schur Functions, Characterizations of Demazure Atoms, and Permuted Basement Nonsymmetric Macdonald Polynomials
• K-theoretic crystals for set-valued tableaux of rectangular shapes
• An analogue of the Robinson-Schensted-Knuth correspondence and non-symmetric Cauchy kernels for truncated staircases
• Properties of non-symmetric Macdonald polynomials at $q=1$ and $q=0$
• Asymmetric function theory
• Colored five-vertex models and Demazure atoms
• Refinements of the Littlewood-Richardson Rule
• NW-SE expansions of non-symmetric Cauchy kernels on near staircases and growth diagrams
• Skew row-strict quasisymmetric Schur functions
• q-symmetric functions and q-quasisymmetric functions
• Backward jeu de taquin slides for composition tableaux and a noncommutative Pieri rule