Related papers: Mixed cobinary trees
Recent articles have shown the connection between representation theory of quivers and the theory of cluster algebras. In this article, we prove that some cluster algebras of type ADE can be recovered from the data of the corresponding…
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…
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…
This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper…
Each quiver appearing in a seed of a cluster algebra determines a corresponding group, which we call a cluster group, which is defined via a presentation. Grant and Marsh showed that, for quivers appearing in seeds of cluster algebras of…
We present an algorithmic mapping from permutations of length dn to labeled n-node d-ary trees and back again. Given such a bijection, one can interpret each of the factorials in the formula for the Catalan numbers as a count of…
This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…
Let $Q$ be a finite acyclic valued quiver. We give the cluster multiplication formulas in the quantum cluster algebra of $Q$ with arbitrary coefficients, by applying certain quotients of derived Hall subalgebras of $Q$. These formulas can…
In this note, we introduce monoidal subcategories of the tensor category of finite-dimensional representations of a simply-laced quantum affine algebra, parametrized by arbitrary Dynkin quivers. For linearly oriented quivers of types A and…
In this paper we first study clusters in type $\tilde{\mathbb{A}}$ by collecting them into a finite number of infinite families given by Dehn twists of their corresponding triangulations, and show that these families are counted by the…
The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$…
We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…
We explicitly describe the tropicalization of a type C cluster variety by identifying it with the space of axially symmetric phylogenetic trees. We also study the signed tropicalizations of this cluster variety, realizing them as subfans of…
We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
A fringe subtree of a rooted tree is a subtree consisting of one of the nodes and all its descendants. In this paper, we are specifically interested in the number of non-isomorphic trees that appear in the collection of all fringe subtrees…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
We construct cluster algebras the variables and coefficients of which satisfy the discrete mKdV equation, the discrete Toda equation and other integrable bilinear equations, several of which lead to q-discrete Painlev\'e equations. These…
Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…