SUPER RSK-ALGORITHMS AND SUPER PLACTIC MONOID
From MaRDI portal
Publication:5483468
Abstract: We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants and Young-Pieri rule. A generalization of the symmetry theorem in the signed case is also obtained. Except for this last result, all the other results are proved without restrictions on the orderings of the alphabets.
Recommendations
Cites work
- A new tableau representation for supersymmetric Schur functions
- An extension of Schensted's theorem
- Applications of hook Young diagrams to P.I. algebras
- Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras
- Longest Increasing and Decreasing Subsequences
- Permutations, matrices, and generalized Young tableaux
- Plethysmsfor representations of lie superalgebras with applications to P. I algebras
- Quelques remarques sur une Construction de Schensted.
Cited in
(10)- Super multiset RSK and a mixed multiset partition algebra
- Notes on Schubert, Grothendieck and key polynomials
- New approaches to plactic monoid via Gröbner-Shirshov bases.
- Shifted insertion algorithms for primed words
- PARASTATISTICS ALGEBRA, YOUNG TABLEAUX AND THE SUPER PLACTIC MONOID
- Super jeu de taquin and combinatorics of super tableaux of type A
- Webs for permutation supermodules of type Q
- Super RSK correspondence with symmetry
- Schurifying quasi‐hereditary algebras
- COSTANDARD MODULES OVER SCHUR SUPERALGEBRAS IN CHARACTERISTIC p
This page was built for publication: SUPER RSK-ALGORITHMS AND SUPER PLACTIC MONOID
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483468)