An analogue of the plactic monoid for binary search trees

2002/06/24 by Florent Hivert, Jean-Christophe Novelli, Hivert, Florent +4 · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Mathematical Dynamics and Fractals #math.CO

paper · pdf · doi:10.48550/arxiv.math/0206246

4 pages, LaTex, French

arxiv created 2002/06/24 · openalex publication_date 2002/06/24 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• A lattice of combinatorial Hopf algebras, Application to binary trees with multiplicities

Related

• Linial arrangements and local binary search trees
• Crystals and trees: quasi-Kashiwara operators, monoids of binary trees,\n and Robinson--Schensted-type correspondences
• Combinatorics of cyclic shifts in plactic, hypoplactic, sylvester, Baxter, and related monoids
• Identities in plactic, hypoplactic, sylvester, Baxter, and related monoids
• A lattice of combinatorial Hopf algebras, Application to binary trees with multiplicities