An analogue of the plactic monoid for binary search trees
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0206246,
title = {An analogue of the plactic monoid for binary search trees},
author = {Florent Hivert and Jean-Christophe Novelli and Jean-Yves Thibon},
journal= {arXiv preprint arXiv:math/0206246},
year = {2007}
}
Comments
4 pages, LaTex, French