An analogue of the plactic monoid for binary search trees
arXiv:math/0206246
Abstract
We introduce a monoid structure on a certain set of labelled binary trees, by a process similar to the construction of the plactic monoid. This leads to a new interpretation of the algebra of planar binary trees of Loday-Ronco.
4 pages, LaTex, French
Cited by in corpus (6)
- Lattice congruences, fans and Hopf algebras
- Algebraic and combinatorial structures on pairs of twin binary trees
- Combinatorial Hopf algebra structure on packed square matrices
- A lattice of combinatorial Hopf algebras, Application to binary trees with multiplicities
- Conjugacy in Patience Sorting monoids
- Algebraic and combinatorial structures on Baxter permutations