An analogue of the plactic monoid for binary search trees

Simple item page
dc.creatorHivert, Florent
dc.creatorNovelli, Jean-Christophe
dc.creatorThibon, Jean-Yves
dc.date2002-06-24
dc.date.accessioned2026-07-07T04:49:19Z
dc.date.available2026-07-07T04:49:19Z
dc.descriptionWe 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.
dc.description4 pages, LaTex, French
dc.identifierhttps://arxiv.org/abs/math/0206246
dc.identifierhttp://arxiv.org/abs/math/0206246
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64378
dc.subjectCombinatorics
dc.titleAn analogue of the plactic monoid for binary search trees
dc.typetext

Files

Collections

arXiv