An analogue of the plactic monoid for binary search trees
classification
🧮 math.CO
keywords
binarymonoidtreesplacticalgebraanaloguecertainconstruction
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.