Keys and alternating sign matrices
From MaRDI portal
Publication:2654623
Abstract: Lascoux and Sch"utzenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices are in bijection with monotone triangles, which form a subclass of Young tableaux. We show that in this case these two notions of keys coincide. Moreover we obtain an elegant and direct way to compute the key of any Young tableau, and discuss consequences of our result.
Recommendations
Cited in
(19)- Bumpless pipe dreams and alternating sign matrices
- Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order
- Colored five-vertex models and Demazure atoms
- Sign-restricted matrices of 0's, 1's, and \(-1\)'s
- Sign matrix polytopes from Young tableaux
- Multiply-refined enumeration of alternating sign matrices
- Prism tableaux for alternating sign matrix varieties
- Matrix realizations of pairs of Young tableaux, keys and shuffles
- Notes on Schubert, Grothendieck and key polynomials
- A direct way to find the right key of a semistandard Young tableau
- scientific article; zbMATH DE number 15435 (Why is no real title available?)
- scientific article; zbMATH DE number 2079099 (Why is no real title available?)
- Semistandard tableaux for Demazure characters (key polynomials) and their atoms
- Alternating sign and sign-restricted matrices: representations and partial orders
- Alternating sign matrices, extensions and related cones
- Matrix tableau-pairs with key and shuffling conditions
- Simple procedures for left and right keys of semi-standard Young tableaux
- Totally symmetric self-complementary plane partition matrices and related polytopes
- Key-avoidance for alternating sign matrices
This page was built for publication: Keys and alternating sign matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654623)