Non-crossing linked partitions, the partial order ≪ on 𝑁𝐶(𝑛), and the 𝑆-transform

DOI10.1090/S0002-9939-09-10218-6MaRDI QIDQ3552118zbMATH OpenFDO

Authors Alexandru Nica

Publication date 13 April 2010

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0901.1175

zbMATH Keywords

free probabilitymoment-cumulant formulaBoolean probabilityreciprocal \(S\)-transform

Mathematics Subject Classification ID

Partitions of sets (05A18) Free probability and free operator algebras (46L54)

Abstract: The paper establishes a connection between two recent combinatorial developments in free probability: the non-crossing linked partitions introduced by Dykema in 2007 to study the S-transform, and the partial order << on NC(n) introduced by Belinschi and Nica in 2008 in order to study relations between free and Boolean probability. More precisely, one has a canonical bijection between NCL(n) (the set of all non-crossing linked partitions of {1, ..., n}) and the set {(p,q) | p,q in NC(n), p<<q}. As a consequence of this bijection, one gets an alternative description of Dykema's formula expressing the moments of a noncommutative random variable a in terms of the coefficients of the reciprocal S-transform 1/S_a. Moreover, due to the Boolean features of <<, this formula can be simplified to a form which resembles the moment-cumulant formula from c-free probability.

Recommendations

• On the structure of the lattice of noncrossing partitions
• Noncrossing partitions, Bruhat order and the cluster complex
• On noncrossing and nonnesting partitions of type \(D\)
• Noncrossing linked partitions and large (3,2)-Motzkin paths
• Noncrossing partitions and Bruhat order
• Noncrossing partitions, noncrossing graphs, and q-permanental equations
• scientific article; zbMATH DE number 7203434
• A combinatorial bijection on \(k\)-noncrossing partitions
• Noncrossing partitions, toggles, and homomesies
• Symmetric chain decompositions and the strong Sperner property for noncrossing partition lattices

Cites work

• scientific article; zbMATH DE number 4082316 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Convolution and limit theorems for conditionally free random variables
• FREE BROWNIAN MOTION AND EVOLUTION TOWARDS ⊞-INFINITE DIVISIBILITY FOR k-TUPLES
• Free Random Variables
• Hopf algebras and the logarithm of the $S$-transform in free probability
• Lectures on the Combinatorics of Free Probability
• Linked partitions and linked cycles
• Multilinear function series and transforms in free probability theory
• Multiplicative functions on the lattice of non-crossing partitions and free convolution
• Noncrossing partitions
• \(\eta\)-series and a Boolean Bercovici--Pata bijection for bounded \(k\)-tuples

Cited in

(8)

• Non-crossing linked partitions and multiplication of free random variables
• Linked partitions and linked cycles
• Singly covered minimal elements of linked partitions and cycles of permutations
• Noncrossing linked partitions and large (3,2)-Motzkin paths
• Noncrossing partitions, Bruhat order and the cluster complex
• Remarks on a free analogue of the beta prime distribution
• Saturated chain partitions in ranked partially ordered sets, and non-monotone symmetric 11-Venn diagrams
• Asymptotic distributions of Wishart type products of random matrices

This page was built for publication: Non-crossing linked partitions, the partial order ≪ on 𝑁𝐶(𝑛), and the 𝑆-transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552118)