Related papers: Periodic trees and semi-invariants
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-reduction process whereby a special type of subtree, called an…
Let T be a locally finite triangulated category with an autoequivalence F such that the orbit category T/F is triangulated. We show that if X is an m-cluster tilting subcategory, then the image of X in T/F is an m-cluster tilting…
The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…
Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate novel fast methods of…
We study complex Dirac structures, that is, Dirac structures in the complexified generalized tangent bundle. These include presymplectic foliations, transverse holomorphic structures, CR-related geometries and generalized complex…
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…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
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…
Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
The uncertainty of multidimensional shift spaces draws attracted attention of researchers. For example, the emptiness problem is undecidable; there exist aperiodic shifts of finite type; there is a nonempty shift of finite type exhibiting…
In aperiodic order, non-periodic but "ordered" objects such as tilings, Delone sets, functions and measures are investigated. In this article we depict the common structure of these objects by using the general framework of abstract pattern…
There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
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…
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…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in two types of random trees: simply generated trees and…
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…