Super jeu de taquin and combinatorics of super tableaux of type A
From MaRDI portal
Publication:5084296
Abstract: This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the analogue of the Sch"{u}tzenberger's jeu de taquin on the structure of super tableaux over a signed alphabet. We show that this procedure which transforms super skew tableaux into super Young tableaux is compatible with the super plactic congruence and it is confluent. We deduce properties relating the super jeu de taquin to insertion algorithms on super tableaux. Moreover, we introduce the super evacuation procedure as an involution on super tableaux and we show its compatibility with the super plactic congruence. Finally, we describe the super jeu de taquin in terms of Fomin's growth diagrams in order to give a combinatorial version of the super Littlewood--Richardson rule.
Recommendations
- Kac–Dynkin diagrams and supertableaux
- Combinatorics on permutation tableaux of type A and type B
- Jack superpolynomials, superpartition ordering and determinantal formulas
- A bijective proof of the hook-content formula for super Schur functions and a modified jeu de taquin
- Jeu de taquin and diamond cone for Lie (super)algebras
- A jeu de taquin theory for increasing tableaux, with application to \(K\)-theoretic Schubert calculus
- scientific article
- The counting polynomial of a supersolvable arrangement
- The direct sum map on Grassmannians and jeu de taquin for increasing tableaux
- Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux
Cites work
- scientific article; zbMATH DE number 1001729 (Why is no real title available?)
- scientific article; zbMATH DE number 4057704 (Why is no real title available?)
- scientific article; zbMATH DE number 4073269 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1757343 (Why is no real title available?)
- A plactic algebra for semisimple Lie algebras
- An extension of Schensted's theorem
- Chinese syzygies by insertions
- Combinatorics of crystal graphs for the root systems of types \(A_n\), \(B_n\), \(C_n\), \(D_n\) and \(G_2\)
- Conditioned random walks and the RSK correspondence
- Crystal bases for the quantum superalgebra $U_q(\mathfrak {gl}(m,n))$
- Crystal graphs and \(q\)-analogues of weight multiplicities for the root system \(A_ n\)
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- Finite convergent presentation of plactic monoid for type C.
- Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras
- Hook flag characters and their combinatorics
- Jeu de taquin dynamics on infinite Young tableaux and second class particles
- Knuth's coherent presentations of plactic monoids of type A
- La correspondance de Robinson
- Longest Increasing and Decreasing Subsequences
- PARASTATISTICS ALGEBRA, YOUNG TABLEAUX AND THE SUPER PLACTIC MONOID
- Permutations, matrices, and generalized Young tableaux
- Plactic algebras.
- Quelques remarques sur une Construction de Schensted.
- Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids.
- SUPER RSK-ALGORITHMS AND SUPER PLACTIC MONOID
- Tropical representations and identities of plactic monoids
Cited in
(3)
This page was built for publication: Super jeu de taquin and combinatorics of super tableaux of type A
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084296)
