2003
DOI: 10.1090/s0002-9947-03-03196-9
|View full text |Cite
|
Sign up to set email alerts
|

Non-crossing cumulants of type B

Abstract: Abstract. We establish connections between the lattices of non-crossing partitions of type B introduced by V. Reiner, and the framework of the free probability theory of D. Voiculescu.Lattices of non-crossing partitions (of type A, up to now) have played an important role in the combinatorics of free probability, primarily via the noncrossing cumulants of R. Speicher. Here we introduce the concept of noncrossing cumulant of type B; the inspiration for its definition is found by looking at an operation of "rest… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
83
0

Year Published

2004
2004
2022
2022

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 43 publications
(83 citation statements)
references
References 16 publications
(35 reference statements)
0
83
0
Order By: Relevance
“…(a) This framework generalizes the link-algebra associated to a noncommutative probability space of type B, in the sense introduced by Biane, Goodman and Nica [2]. One can thus take the point of view that (1.1) provides us with an enlarged framework for doing "free probability of type B".…”
Section: The Framework Of the Papermentioning
confidence: 90%
“…(a) This framework generalizes the link-algebra associated to a noncommutative probability space of type B, in the sense introduced by Biane, Goodman and Nica [2]. One can thus take the point of view that (1.1) provides us with an enlarged framework for doing "free probability of type B".…”
Section: The Framework Of the Papermentioning
confidence: 90%
“…Coxeter-plane diagrams of parabolic subgroups are centrally symmetric set partitions of the vertices of the 2n-gon. Noncrossing Criterion 1 is the combinatorial crossing/noncrossing criterion of [19], which has been shown in [4,6,10] to correctly classify parabolic subgroups as crossing/noncrossing in the algebraic sense. Again, to correctly compare the above construction to [4,6,10,19], one must take the correct 2n-cycle c described above.…”
Section: 1mentioning
confidence: 99%
“…Now many extensions and generalizations of free probability have been discovered. Infinitesimal freeness is one of the generalization of freeness [4], [2]. An application of infinitesimal freeness to random matrix theory was first presented by Shlyakhtenko [20], and he showed how to understand the finite rank perturbation in some random matrix models by applying infinitesimal freenss.…”
Section: Introductionmentioning
confidence: 99%