Related papers: Planar binary trees, noncrossing partitions and th…
Recently it has been speculated that the S-matrix elements on the world volume of D$_3$-branes should satisfy the ward identity corresponding to the S-duality transformations. For a single brane and in the low energy limit, this indicates…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…
We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…
The property of being shift invariant and being reflexive or transitive in the case of the space of (asymmetric) truncated Toeplitz operators, and the space of (asymmetric) dual truncated operators is investigated. Most of the results…
If $A\otimes _{R, \sigma }V$ and $A\otimes _{P, \nu }W$ are two Brzezi\'nski crossed products and $Q:W\otimes V\rightarrow V\otimes W$ is a linear map satisfying certain properties, we construct a Brzezi\'{n}ski crossed product $A\otimes…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
We construct a tree-based dependence structure for the representation of binomial, Poisson and Gaussian random vectors having a given covariance matrix, using sums of independent random variables. This construction allows us to characterize…
The problem of comparing trees representing the evolutionary histories of cancerous tumors has turned out to be crucial, since there is a variety of different methods which typically infer multiple possible trees. A departure from the…
We discuss possible phase factors for the S-matrix of planar N=4 gauge theory, leading to modifications at four-loop order as compared to an earlier proposal. While these result in a four-loop breakdown of perturbative BMN-scaling,…
Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets facing each other on two vertical lines. Instead of minimizing…
In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…
In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…
The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…
We will define an operad $\mathcal{B}^0$ on planar rooted trees. $\mathcal{B}^0$ is analgous to the $NAP$-operad in the non-planar tree setting. We will define a family of "current-preserving" operads $\mathcal{B}^\lambda$ depending on a…
M. Lin defined a binary operation for two positive semi-definite matrices in studying certain determinantal inequalities that arise from diffusion tensor imaging. This operation enjoys some interesting properties similar to the operator…
We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…
A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…