The Algebra of Binary Search Trees

We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new construction of the algebra of Planar Binary Trees of Loday-Ronco, defining it in the same way as Non-Commutative Symmetric Functions and Free Symmetric Functions. We briefly explain how the main known properties of the Loday-Ronco algebra can be described and proved with this combinatorial point of view, and then discuss it from a representation theoretical point of view, which in turns leads to new combinatorial properties of binary trees.Comment: 49 page

Hopf Algebras of m-permutations, (m+1)-ary trees, and m-parking functions

The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the Loday-Ronco Hopf algebra of planar binary trees. We introduce new combinatorial Hopf algebras based on (m+1)-ary trees, whose structure is described by the m-Tamari lattices. In the same way as planar binary trees can be interpreted as sylvester classes of permutations, we obtain (m+1)-ary trees as sylvester classes of what we call m-permutations. These objects are no longer in bijection with decreasing (m+1)-ary trees, and a finer congruence, called metasylvester, allows us to build Hopf algebras based on these decreasing trees. At the opposite, a coarser congruence, called hyposylvester, leads to Hopf algebras of graded dimensions (m+1)^{n-1}, generalizing noncommutative symmetric functions and quasi-symmetric functions in a natural way. Finally, the algebras of packed words and parking functions also admit such m-analogues, and we present their subalgebras and quotients induced by the various congruences.Comment: 51 page

On shuffle ideals of general algebras

We extend a word language concept called shuffle ideal to general algebras. For this purpose, we introduce the relation SH and show that there exists a natural connection between this relation and the homeomorphic embedding order on trees. We establish connections between shuffle ideals, monotonically ordered algebras and automata, and piecewise testable tree languages

Relations between elliptic multiple zeta values and a special derivation algebra

We investigate relations between elliptic multiple zeta values and describe a method to derive the number of indecomposable elements of given weight and length. Our method is based on representing elliptic multiple zeta values as iterated integrals over Eisenstein series and exploiting the connection with a special derivation algebra. Its commutator relations give rise to constraints on the iterated integrals over Eisenstein series relevant for elliptic multiple zeta values and thereby allow to count the indecomposable representatives. Conversely, the above connection suggests apparently new relations in the derivation algebra. Under https://tools.aei.mpg.de/emzv we provide relations for elliptic multiple zeta values over a wide range of weights and lengths.Comment: 43 pages, v2:replaced with published versio

On a conjecture by Pierre Cartier about a group of associators

In \cite{cartier2}, Pierre Cartier conjectured that for any non commutative formal power series $\Phi$ on $X=\{x_0,x_1\}$ with coefficients in a \Q-extension, $A$, subjected to some suitable conditions, there exists an unique algebra homomorphism $\varphi$ from the \Q-algebra generated by the convergent polyz\^etas to $A$ such that $\Phi$ is computed from $\Phi_{KZ}$ Drinfel'd associator by applying $\varphi$ to each coefficient. We prove $\varphi$ exists and it is a free Lie exponential over $X$. Moreover, we give a complete description of the kernel of polyz\^eta and draw some consequences about a structure of the algebra of convergent polyz\^etas and about the arithmetical nature of the Euler constant