Free dendriform algebras. I: A parenthesis setting (Q2644151)

A \(K\)-vector space \(E\) is a dendriform algebra if it is equipped with two binary operations \(\prec\) and \(\succ\) satisfying the following axioms: \((x\prec y)\prec z=x\prec (y\star z)\), \((x\succ y) \prec z=x\succ (y\prec z)\), \((x\star y)\succ z=x\succ(y\succ z)\) for all \(x,y,z\in E\), where \(x\star y:=x\prec y+ x\succ y\). This concept has been introduced by J.-L. Loday as dual, in operadic sense, to associative dialgebras. The author reformulates some known results on free dendriform algebras on one generator via a paranthesis setting, instead of using permutations. A bijection between planar rooted binary trees and noncrossing partitions is given, and this allows the introduction of the notion of noncrossing partitions operads. Finally, applications to free probability theory are given.