Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences
From MaRDI portal
(Redirected from Publication:1706249)
Abstract: Kashiwara's crystal graphs have a natural monoid structure that arises by identifying words labelling vertices that appear in the same position of isomorphic components. The celebrated plactic monoid (the monoid of Young tableaux), arises in this way from the crystal graph for the -analogue of the general linear Lie algebra , and the so-called Kashiwara operators interact beautifully with the combinatorics of Young tableaux and with the Robinson--Schensted--Knuth correspondence. The authors previously constructed an analogous `quasi-crystal' structure for the related hypoplactic monoid (the monoid of quasi-ribbon tableaux), which has similarly neat combinatorial properties. This paper constructs an analogous `crystal-type' structure for the sylvester and Baxter monoids (the monoids of binary search trees and pairs of twin binary search trees, respectively). Both monoids are shown to arise from this structure just as the plactic monoid does from the usual crystal graph. The interaction of the structure with the sylvester and Baxter versions of the Robinson-Schensted-Knuth correspondence is studied. The structure is then applied to prove results on the number of factorizations of elements of these monoids, and to prove that both monoids satisfy non-trivial identities.
Recommendations
- Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson-Schensted-Knuth-type correspondence for quasi-ribbon tableaux
- scientific article; zbMATH DE number 2051148
- Combinatorics of crystal graphs for the root systems of types A_n, B_n, C_n, D_n and G₂
- Schensted-type correspondences and plactic monoids for types \(B_n\) and \(D_n\)
- Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, Baxter, and related monoids
Cites work
- Algebraic and combinatorial structures on pairs of twin binary trees
- Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, and related monoids
- Counting linear extensions
- Crystal graphs for representations of the q-analogue of classical Lie algebras
- 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}\)
- Crystalizing the q-analogue of universal enveloping algebras
- Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson-Schensted-Knuth-type correspondence for quasi-ribbon tableaux
- Hecke algebras, difference operators, and quasi-symmetric functions
- scientific article; zbMATH DE number 1001729 (Why is no real title available?)
- scientific article; zbMATH DE number 3817997 (Why is no real title available?)
- scientific article; zbMATH DE number 3582368 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1181673 (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?)
- scientific article; zbMATH DE number 1422717 (Why is no real title available?)
- Lattice of combinatorial Hopf algebras: binary trees with multiplicities
- Noncommutative Schubert polynomials
- NONCOMMUTATIVE SYMMETRIC FUNCTIONS V: A DEGENERATE VERSION OF Uq(glN)
- Noncommutative symmetric functions. IV: Quantum linear groups and Hecke algebras at \(q=0\)
- On crystal bases of the \(q\)-analogue of universal enveloping algebras
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
- On the hypoplactic monoid
- Physics and theoretical computer science. From numbers and languages to (quantum) cryptography.
- Plactic classification of modes
- Schubert polynomials and the Littlewood-Richardson rule
- The algebra of binary search trees
Cited in
(11)- Schensted-type correspondences and plactic monoids for types \(B_n\) and \(D_n\)
- An analogue of the plactic monoid for binary search trees
- A crystal on decreasing factorizations in the 0-Hecke monoid
- Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, Baxter, and related monoids
- Tropical representations and identities of the stylic monoid
- Combinatorics of crystal graphs for the root systems of types A_n, B_n, C_n, D_n and G₂
- scientific article; zbMATH DE number 2051148 (Why is no real title available?)
- Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson-Schensted-Knuth-type correspondence for quasi-ribbon tableaux
- Identities and bases in the Sylvester and Baxter monoids
- Plactic-like monoids arising from meets and joins of stalactic and taiga congruences
- Double crystals of binary and integral matrices
This page was built for publication: Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706249)