Related papers: Mixed cobinary trees

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…

There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…

Cayley's formula states that the number of labelled trees on $n$ vertices is $n^{n-2}$, and many of the current proofs involve complex structures or rigorous computation. We present a bijective proof of the formula by providing an…

We give a simple explanation why the stationary state of the 1D TASEP model with open boundaries is related to the Catalan numbers. Our construction is based on planar binary trees and provides a combinatorial solution of the stationary…

We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…

Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…

In \cite{rupel3},the authors defined algebra homomorphisms from the dual Ringel-Hall algebra of certain hereditary abelian category $\mathcal{A}$ to an appropriate $q$-polynomial algebra. In the case that $\mathcal{A}$ is the representation…

Following a remark of Lawvere, we explicitly exhibit a particularly elementary bijection between the set T of finite binary trees and the set T^7 of seven-tuples of such trees. "Particularly elementary" means that the application of the…

We relate the mixed Hodge structure on the cohomology of open positroid varieties (in particular, their Betti numbers over $\mathbb{C}$ and point counts over $\mathbb{F}_q$) to Khovanov--Rozansky homology of associated links. We deduce that…

Let $Q$ be a finite quiver without oriented cycles and $k$ an algebraically closed field.In this paper we establish a connection between cluster algebras and the representation theory of the path algebra $kQ$, in terms of the spectral…

We introduce some classes of increasing labeled and multilabeled trees, and we show that these trees provide combinatorial interpretations for certain Thron-type continued fractions with coefficients that are quasi-affine of period 2. Our…

For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…

We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e a…

This article considers some affine algebraic varieties attached to finite trees and closely related to cluster algebras. Their definition involves a canonical coloring of vertices of trees into three colors. These varieties are proved to be…

Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…

We study the cluster algebras arising from cluster tubes with rank bigger than $1$. Cluster tubes are $2-$Calabi-Yau triangulated categories which contain no cluster tilting objects, but maximal rigid objects. Fix a certain maximal rigid…

Motivated by a formula of A. Postnikov relating binary trees, we define the hook length polynomials for m-ary trees and plane forests, and show that these polynomials have a simple binomial expression. An integer value of this expression is…

We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…

In this paper, we present an involution on some kind of colored $k$-ary trees which provides a combinatorial proof of a combinatorial sum involving the generalized Catalan numbers $C_{k,\gamma}(n)=\frac{\gamma}{k n+\gamma}{k n+\gamma\choose…