Related papers: Planar binary trees, noncrossing partitions and th…
We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…
We classify the $\mathscr{R}$-cross-sections of the monoid of order-preserving transformations on the $n$-element chain in terms of certain binary trees.
We study a realization of S dualities of four-dimensional $\mathcal{N}=2$ class $\mathcal{S}$ theories based on BPS graphs. S duality transformations of the UV curve are explicitly expressed as a sequence of topological transitions of the…
Herein we explore a dual tree algorithm for matrix multiplication of $A\in \mathbb{R}^{M\times D}$ and $B\in\mathbb{R}^{D\times N}$, very narrowly effective if the normalized rows of $A$ and columns of $B$, treated as vectors in…
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
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…
A valuation theoretic approach is presented that directly leads to division algebras that are noncrossed products (instead of, e.g., describing Brauer classes of noncrossed products in an abstract manner). While this feature is shared by…
We initiate the S-matrix bootstrap analysis of theories with non-invertible symmetries in (1+1) dimensions. Our previous work showed that crossing symmetry of S-matrices in such theories is modified, with modification characterized by the…
We characterize matrix-valued asymmetric truncated Toeplitz operators (which are compressions of multiplication operators acting between two possibly different model spaces) by using compressed shifts, modified compressed shifts and shift…
We study composition 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 and the essential norm. In addition, we study the isometric…
We introduce a new basis of the Temperley-Lieb algebra. It is defined using a bijection between noncrossing partitions and fully commutative elements together with a basis introduced by Zinno, which is obtained by mapping the simple…
In this paper, we introduce a discrete analogue of weighted Hardy spaces on rooted trees and study weighted composition operators between them in detail. In particular, we characterize bounded and compact weighted composition operators…
We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schr{\"o}der paths and Schr{\"o}der paths without peaks at even height. We also give a direct bijection between 2-distant…
We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…
We show that a weighted shift on a directed tree is related to a multiplier algebra of coefficients of analytic functions. We use this relation to study spectral properties of the operators in question.
Let $\mathcal{L}$ be the space of complex-valued functions $f$ on the set of vertices $T$ of an rooted infinite tree rooted at $o$ such that the difference of the values of $f$ at neighboring vertices remains bounded throughout the tree,…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…