Free dendriform dialgebras: reformulation and application in free probability. Part I
Combinatorics
2007-05-23 v1 Quantum Algebra
Abstract
We propose a reformulation of some results known on the free dendriform dialgebra on one generator from a parenthesis point of view. This turns out to be more tractable and point out a connection to free probability by identifying noncrossing partitions with binary trees and by introducing the concept of NCP-operad.
Keywords
Cite
@article{arxiv.math/0408348,
title = {Free dendriform dialgebras: reformulation and application in free probability. Part I},
author = {Leroux Philippe},
journal= {arXiv preprint arXiv:math/0408348},
year = {2007}
}
Comments
21 pages, 4 figures