Related papers: Combinatorics of cyclic-conditional freeness
Using the combinatorics of non-crossing partitions, we construct a conditionally free analogue of the Voiculescu's S-transform. The result is applied to analytical description of conditionally free multiplicative convolution and…
We consider two extensions of free probability that have been studied in the research literature, and are based on the notions of c-freeness and respectively of infinitesimal freeness for noncommutative random variables. In a 2012 paper,…
We derive a formula for expressing free cumulants whose entries are products of random variables in terms of the lattice structure of non-crossing partitions. We show the usefulness of that result by giving direct and conceptually simple…
I give a survey about my work on combinatorial and probabilistic aspects of free probability theory. In particular, I present the combinatorial description of freeness in terms of free cumulants and I give some ideas of the main results of…
This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…
In this paper, we develop the theory of bi-freeness in an amalgamated setting. We construct the operator-valued bi-free cumulant functions, and show that the vanishing of mixed cumulants is necessary and sufficient for bi-free independence.…
Two known results on the relationship between conditional and unconditional independence are obtained as a consequence of the main result of this paper, a theorem that uses independence of Markov kernels to obtain a minimal condition which…
In this paper, the notion of conditionally bi-free independence for pairs of algebras is introduced. The notion of conditional $(\ell, r)$-cumulants are introduced and it is demonstrated that conditionally bi-free independence is equivalent…
The $\mathcal{A}$-tracial algebras are algebras endowed with multi-linear forms, compatible with the product, and indexed by partitions. Using the notion of $\mathcal{A}$-cumulants, we define and study the $\mathcal{A}$-freeness property…
We introduce the notion of a conditionally free product and conditionally free convolution. We describe this convolution both from a combinatorial point of view, by showing its connection with the lattice of non-crossing partitions, and…
In this paper we define cumulants for finite free convolution. We give a moment-cumulant formula and show that these cumulants satisfy desired properties: they are additive with respect to finite free convolution and they approach free…
The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…
In this paper, we introduce the notion of conditionally bi-free independence in an amalgamated setting. We define operator-valued conditionally bi-multiplicative pairs of functions and construct operator-valued conditionally bi-free moment…
We prove a free analogue of Brillinger's formula (sometimes called "law of total cumulance") which expresses classical cumulants in terms of conditioned cumulants. As expected, the formula is obtained by replacing the lattice of set…
We introduce a new kind of free independence, called real infinitesimal freeness. We show that independent orthogonally invariant with infinitesimal laws are asymptotically real infinitesimally free. We introduce new cumulants, called real…
Free cumulants were introduced as the proper analog of classical cumulants in the theory of free probability. There is a mix of similarities and differences, when one considers the two families of cumulants. Whereas the combinatorics of…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
The main result of this paper is an explicit construction of the free commutative skew brace -- that is, a skew brace whose circle group is commutative -- on an arbitrary generating set $X$. We embed this object into a set of rational…
We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus…
The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.