Related papers: Mixed cobinary trees
We use monoidal category methods to study the noncommutative geometry of nonassociative algebras obtained by a Drinfeld-type cochain twist. These are the so-called quasialgebras and include the octonions as braided-commutative but…
In this paper, we present an explicit and purely combinatorial characterization of the $m$-coloured quivers that appear within the $m$-coloured mutation class of a quiver of type $\mathbb{D}_n$. The $m$-coloured mutation, as defined by Buan…
We realize a family of generalized cluster algebras as Caldero-Chapoton algebras of quivers with relations. Each member of this family arises from an unpunctured polygon with one orbifold point of order 3, and is realized as a…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
We study the enumeration of mixed dimer covers on skew Young diagrams of ribbon shape (also called border strips or snake graphs). For the two extreme cases of straight and zigzag shapes, we show that the number of mixed dimer covers are…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
Hex-trees are identified as a particular instance of weighted unary-binary trees. The Horton-Strahler numbers of these objects are revisited, and, thanks to a substitution that is not immediately intuitive, explicit results are possible.…
We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in $1/\pi$ with rational coefficients; the proof is effective and provides an algorithm to explicitly compute…
Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…
We study relations between cluster algebra invariants and link invariants. First, we show that several constructions of positroid links (permutation links, Richardson links, grid diagram links, plabic graph links) give rise to isotopic…
Recently, Ramos and Whiting showed that any generalized cluster algebra of geometric type is isomorphic to a quotient of a subalgebra of a certain cluster algebra. Based on their idea and method, we show that the same property holds for any…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
We present a combinatorial model for cluster algebras of type $D_n$ in terms of centrally symmetric pseudotriangulations of a regular $2n$-gon with a small disk in the centre. This model provides convenient and uniform interpretations for…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We describe a new way to relate an acyclic, skew-symmetrizable cluster algebra to the representation theory of a finite dimensional hereditary algebra. This approach is designed to explain the c-vectors of the cluster algebra. We obtain a…
We resolve a question of Gillespie, Griffin, and Levinson that asks for a combinatorial bijection between two classes of trivalent trees, tournament trees and slide trees, that both naturally arise in the intersection theory of the moduli…
We give a formula for the class number of an arbitrary CM algebraic torus over $\mathbb{Q}$. This is proved based on results of Ono and Shyr. As applications, we give formulas for numbers of polarized CM abelian varieties, of connected…
Let C be the category of finite-dimensional representations of a quantum affine algebra of simply-laced type. We introduce certain monoidal subcategories C_l (l integer) of C and we study their Grothendieck rings using cluster algebras.
A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…