Free dendriform dialgebras: reformulation and application in free probability. Part I
classification
🧮 math.CO
math.QA
keywords
freedendriformpointprobabilityreformulationapplicationbinaryconcept
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.