Planar binary trees, noncrossing partitions and the operator-valued S-transform
From MaRDI portal
Cites work
- A correspondence between ordered trees and noncrossing partitions
- A short proof for the twisted multiplicativity property of the operator-valued \(S\)-transform
- An introduction to random matrices
- Arithmetree.
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems
- Catalan Numbers
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Free probability and random matrices
- Free Random Variables
- Groups of tree-expanded series.
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 854211 (Why is no real title available?)
- Lectures on the Combinatorics of Free Probability
- Monotone cumulant-moment formula and Schröder trees
- Monotone, free, and Boolean cumulants: a shuffle algebra approach
- Multichains, non-crossing partitions and trees
- Multilinear function series and transforms in free probability theory
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- Non-commutative notions of stochastic independence
- Noncommutative symmetric functions and Lagrange inversion. II: Noncrossing partitions and the Farahat-Higman algebra
- On the S-transform over a Banach algebra
- Operads of (noncrossing) partitions, interacting bialgebras, and moment-cumulant relations
- Ordered trees and non-crossing partitions
- Random matrices, free probability, planar algebras and subfactors
- THE FIVE INDEPENDENCES AS NATURAL PRODUCTS
This page was built for publication: Planar binary trees, noncrossing partitions and the operator-valued S-transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6872907)