2019
DOI: 10.1016/j.jfa.2019.05.005
|View full text |Cite
|
Sign up to set email alerts
|

Free-Boolean independence for pairs of algebras

Weihua Liu

Abstract: We construct pairs of algebras with mixed independence relations by using truncations of reduced free products of algebras. For example, we construct free-Boolean pairs of algebras and free-monotone pairs of algebras. We also introduce free-Boolean cumulants and show that free-Boolean independence is equivalent to the vanishing of mixed cumulants.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
27
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 11 publications
(27 citation statements)
references
References 14 publications
0
27
0
Order By: Relevance
“…In this section, we review some combinatorial tools which will be used to define operator-valued free-Boolean cumulants. We give a characterization of free-Boolean independence with amalgamation thereby generalizes results in [8] to the operator-valued framework. In noncommutative probability theory, non-crossing partitions are used in the combinatorics of free probability and the interval partitions are used in the combinatorics of Boolean independence.…”
Section: Interval-noncrossing Partitionsmentioning
confidence: 88%
See 4 more Smart Citations
“…In this section, we review some combinatorial tools which will be used to define operator-valued free-Boolean cumulants. We give a characterization of free-Boolean independence with amalgamation thereby generalizes results in [8] to the operator-valued framework. In noncommutative probability theory, non-crossing partitions are used in the combinatorics of free probability and the interval partitions are used in the combinatorics of Boolean independence.…”
Section: Interval-noncrossing Partitionsmentioning
confidence: 88%
“…In noncommutative probability theory, non-crossing partitions are used in the combinatorics of free probability and the interval partitions are used in the combinatorics of Boolean independence. It turns out the partitions used in the combinatorics of free-Boolean independence are so-called interval-noncrossing partitions introduced in [8]. All results without proof in this section are taken from [8].…”
Section: Interval-noncrossing Partitionsmentioning
confidence: 99%
See 3 more Smart Citations