Related papers: Mixed cobinary trees
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial…
We explicitly describe the tropicalization of a cluster variety of finite type C, realizing it as the space of axially symmetric phylogenetic trees. We also find all occurring sign patterns of coordinates, for both the cluster variety and…
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We give a formula for counting tree modules for the quiver S_g with g loops and one vertex in terms of tree modules on its universal cover. This formula, along with work of Helleloid and Rodriguez-Villegas, is used to show that the number…
This is a largely expository paper in which we discuss various sets having a Catalan number of objects and some well-known bijections between these sets presented in a new and hopefully interesting way. We call these concepts "bookshelf"…
Let $Q$ be the affine quiver of type $\widetilde{A}_{2n-1,1}$ and $\mathcal{A}_{q}(Q)$ be the quantum cluster algebra associated to the valued quiver $(Q,(2,2,\dots,2))$. We prove some cluster multiplication formulas, and deduce that the…
We introduce $\mathcal{Q}^N$ quivers and construct maximal green sequences for these quivers. We prove that any finite connected full subquiver of the quivers defined by Hernandez and Leclerc, arising in monoidal categorifications of…
We compute the number of $\mathcal{X}$-variables (also called coefficients) of a cluster algebra of finite type when the underlying semifield is the universal semifield. For classical types, these numbers arise from a bijection between…
We introduce a random recursive tree model with two communities, called balanced community modulated random recursive tree, or BCMRT in short. In this setting, pairs of nodes of different type appear sequentially. Each node of the pair…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
We consider so-called simple families of labelled trees, which contain, e.g., ordered, unordered, binary and cyclic labelled trees as special instances, and study the global and local behaviour of the number of inversions. In particular we…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
Motivated by the problem of classifying quantum symmetries of non-semisimple, finite-dimensional associative algebras, we define a notion of connection between bounded quivers and build a bicategory of bounded quivers and quiver…
We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic traversal of the decision…