The algebra of binary search trees
Theoretical Computer Science - Combinatorics on words
Hi-index | 0.00 |
We prove a q-identity in the dendriform algebra of colored free quasi-symmetric functions. For q=1, we recover identities due to Ebrahimi-Fard, Manchon, and Patras, in particular the noncommutative Bohnenblust-Spitzer identity.