vix.ing · top · new · best · stats · spec

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

2004/08/25 by Philippe Leroux, Leroux Philippe, Philippe, Leroux
Mathematics · #05C05 #06A07 #11A99 #46L54 #Advanced Combinatorial Mathematics #Advanced Topics in Algebra #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Quantum Algebra (math.QA) #math.CO #math.QA #msc:05C05 #msc:06A07 #msc:11A99 #msc:46L54

paper · pdf · doi:10.48550/arxiv.math/0408348

21 pages, 4 figures

arxiv created 2004/08/25 · openalex publication_date 2004/08/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

Related