Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson--Schensted-type correspondences
Alan J. Cain, Ant\'onio Malheiro

TL;DR
This paper develops a new crystal-type combinatorial structure for the sylvester and Baxter monoids, linking them to Robinson--Schensted correspondences and analyzing their algebraic properties.
Contribution
It introduces a novel 'crystal-type' structure for sylvester and Baxter monoids, extending crystal graph concepts beyond classical cases.
Findings
Both monoids arise from the new structure similarly to the plactic monoid.
The structure interacts with Robinson--Schensted--Knuth correspondences for these monoids.
Results on factorizations and identities within these monoids are established.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
