A direct way to find the right key of a semistandard Young tableau
From MaRDI portal
Publication:360352
DOI10.1007/S00026-013-0187-4zbMATH Open1270.05100arXiv1110.6184OpenAlexW2004540213MaRDI QIDQ360352FDOQ360352
Authors: Matthew J. Willis
Publication date: 26 August 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Abstract: The right and left key of a semistandard Young tableau were introduced by Lascoux and Schutzenberger in 1990. Most prominently, the right key is a tool used to find Demazure characters for sl(n,C). Previous methods used to compute these keys require introducing other types of combinatorial objects. This paper gives methods to obtain the right and left keys by inspection of the semistandard Young tableau.
Full work available at URL: https://arxiv.org/abs/1110.6184
Recommendations
Combinatorial aspects of representation theory (05E10) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10)
Cites Work
- Key polynomials and a flagged Littlewood-Richardson rule
- Straightening for standard monomials on Schubert varieties
- Title not available (Why is that?)
- Semistandard tableaux for Demazure characters (key polynomials) and their atoms
- Flag varieties. An interplay of geometry, combinatorics, and representation theory
- An explicit construction of type A Demazure atoms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Affine Weyl Groups in K-Theory and Representation Theory
- On the combinatorics of crystal graphs. I: Lusztig's involution
- Chains in the Bruhat order
- A unified approach to combinatorial formulas for Schubert polynomials
Cited In (15)
- Accessible proof of standard monomial basis for coordinatization of Schubert sets of flags
- Semistandard tableaux for Demazure characters (key polynomials) and their atoms
- Saturation for flagged skew Littlewood-Richardson coefficients
- An analogue of the Robinson-Schensted-Knuth correspondence and non-symmetric Cauchy kernels for truncated staircases
- Relating the right key to the type A filling map and minimal defining chains
- Symplectic keys and Demazure atoms in type \(C\)
- Set-valued tableaux rule for Lascoux polynomials
- The ``Young and ``reverse dichotomy of polynomials
- Demazure crystal structure for flagged reverse plane partitions
- Colored five-vertex models and Demazure atoms
- Symplectic right keys -- type C Willis' direct way
- Colored five‐vertex models and Lascoux polynomials and atoms
- Grothendieck-to-Lascoux expansions
- A bijection between \(K\)-Kohnert diagrams and reverse set-valued tableaux
- K-theoretic crystals for set-valued tableaux of rectangular shapes
This page was built for publication: A direct way to find the right key of a semistandard Young tableau
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360352)