Related papers: Planar binary trees, noncrossing partitions and th…
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.
We investigate the algebraic structure underlying Voiculescu's S-transform in the setting of operator-valued free probability. We show that its twisted factorisation property gives rise to post-groups, crossed morphisms, as well as pre- and…
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…
In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…
We study multiplication operators on the weighted Banach spaces of an infinite tree. We characterize the bounded and the compact operators, as well as determine the operator norm. In addition, we determine the spectrum of the bounded…
We provide a short proof for the twisted multiplicativity property of the operator-valued S-transform. This is my contribution to the topical collection ''Multivariable Operator Theory. The J\"org Eschmeier Memorial'' of Complex Analysis…
In this paper, we present a combinatorial approach to the 2-variable bi-free partial $S$- and $T$-transforms recently discovered by Voiculescu. This approach produces an alternate definition of said transforms using $(\ell, r)$-cumulants.
We discuss some results concerning the multiplication of non-commutative random variables that are c-free with respect to a pair $( \Phi, \varphi) $, where $ \Phi $ is a linear map with values in some Banach or C$^\ast$-algebra and $…
In this article, we characterize the bounded and the compact multiplication operators between distinct iterated logarithmic Lipschitz spaces, and between the Lipschitz space and an iterated logarithmic Lipschitz space of an infinite tree.…
Using the theory of Properly Embedded Graphs developed in an earlier work we define an involutory duality on the set labeled non-crossing trees that lifts the obvious duality in the set of unlabeled non-crossing trees. The set of…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We systematically study various aspects of operator-valued multishifts. Beginning with basic properties, we show that the class of multishifts on the directed Cartesian product of rooted directed trees is contained in that of…
It is shown that the fourth order real self-adjoint difference operator on the Tivalent Tree admits nontrivial deformations preserving one energy level and therefore defines a nontrinial hierarhy of the completely integrable nonlinear…
We introduce operator-valued twisted Araki-Woods algebras. These are operator-valued versions of a class of second quantization algebras that includes $q$-Gaussian and $q$-Araki-Woods algebras and also generalize Shlyakhtenko's von Neumann…
We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…
In a supercritical branching particle system, the trimmed tree consists of those particles which have descendants at all times. We develop this concept in the superprocess setting. For a class of continuous superprocesses with Feller…
We use the theory of fully matricial, or non-commutative, functions to investigate infinite divisibility and limit theorems in operator-valued non-commutative probability. Our main result is an operator-valued analogue of the Bercovici-Pata…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
This work addresses an enumeration problem on weighted bi-colored plane trees with prescribed vertex data, with all vertices labeled distinctly. We give a bijection proof of the enumeration formula originally due to Kochetkov, hence…
This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree…