arXiv Analytics

Sign in

arXiv:math/0206246 [math.CO]AbstractReferencesReviewsResources

An analogue of the plactic monoid for binary search trees

Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon

Published 2002-06-24Version 1

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.

Comments: 4 pages, LaTex, French
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:math/9910070 [math.CO] (Published 1999-10-14)
A q-analogue of the path length of binary search trees
arXiv:2401.14318 [math.CO] (Published 2024-01-25)
Planar binary trees, noncrossing partitions and the operator-valued S-transform
arXiv:2011.14413 [math.CO] (Published 2020-11-29)
Planar binary trees in scattering amplitudes

Links

Toolbox