Free dendriform dialgebras: reformulation and application in free probability. Part I

Simple item page
dc.creatorPhilippe, Leroux
dc.date2004-08-25
dc.date.accessioned2026-07-07T05:11:33Z
dc.date.available2026-07-07T05:11:33Z
dc.descriptionWe 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.
dc.description21 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0408348
dc.identifierhttp://arxiv.org/abs/math/0408348
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72282
dc.subjectCombinatorics
dc.subjectQuantum Algebra
dc.subject05C05; 06A07; 11A99; 46L54
dc.titleFree dendriform dialgebras: reformulation and application in free probability. Part I
dc.typetext

Files

Collections

arXiv