A decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth algorithm
From MaRDI portal
Publication:2654612
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.
Recommendations
- scientific article; zbMATH DE number 483115
- The Schur algorithm and coefficient characterizations for generalized Schur functions
- The Decompositions of Schur Complexes
- Combinatorial algorithms for the expansion of various products of Schur functions
- The Schur algorithm and its applications
- The Schubert calculus of decomposable permutations
- The generalized Schur algorithm and some applications
- A recursion formula for k-Schur functions
- Factorization of the Robinson-Schensted-Knuth correspondence
- A decomposition of Solomon's descent algebra
Cited in
(35)- An explicit construction of type A Demazure atoms
- Permuted composition tableaux, 0-Hecke algebra and labeled binary trees
- Quasisymmetric and noncommutative skew Pieri rules
- Set-valued skyline fillings
- Factorization of the Robinson-Schensted-Knuth correspondence
- Schur operators and Knuth correspondences
- Canonical decompositions of affine permutations, affine codes, and split \(k\)-Schur functions
- Properties of non-symmetric Macdonald polynomials at \(q=1\) and \(q=0\)
- Lifting the dual immaculate functions
- An algorithm for Berenstein-Kazhdan decoration functions and trails for minuscule representations
- Colored five-vertex models and Lascoux polynomials and atoms
- Colored five-vertex models and Demazure atoms
- An analogue of the Robinson-Schensted-Knuth correspondence and non-symmetric Cauchy kernels for truncated staircases
- Backward jeu de taquin slides for composition tableaux and a noncommutative Pieri rule
- On \(q\)-symmetric functions and \(q\)-quasisymmetric functions
- Combinatorial bases of polynomials
- A Pieri rule for key polynomials
- Colored five-vertex models and Lascoux polynomials and atoms
- Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm
- Row-strict quasisymmetric Schur functions
- A new Littlewood-Richardson rule for Schur \(P\)-functions
- Decomposition of the product of a monomial and a Demazure atom
- From symmetric fundamental expansions to Schur positivity
- Asymmetric function theory
- Polynomials from combinatorial K-theory
- Polynomial bases: positivity and Schur multiplication
- Semi-skyline augmented fillings and non-symmetric Cauchy kernels for stair-type shapes.
- K-theoretic crystals for set-valued tableaux of rectangular shapes
- Quasisymmetric Schur functions
- Skew quasisymmetric Schur functions and noncommutative Schur functions
- Nonsymmetric Cauchy Kernel, crystals and last passage percolation
- Colored line ensembles for stochastic vertex models
- Quasisymmetric Schur Q-functions and peak Young quasisymmetric Schur functions
- Skew row-strict quasisymmetric Schur functions
- Littlewood-Richardson rules for symmetric skew quasisymmetric Schur functions
This page was built for publication: A decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654612)
