Related papers: Complexes of trees and nested set complexes
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly used to represent the evolution of species which cross with one another. A special type of phylogenetic network is an {\em $X$-cactus}, which…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
The degree distribution of an ordered tree $T$ with $n$ nodes is $\vec{n} = (n_0,\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\mathcal{N}(\vec{n})$ be the number of trees with degree distribution…
Nested (or reconciled) phylogenetic trees model co-evolutionary systems in which one evolutionary history is embedded within another. We introduce a geometric framework for such systems by defining $\sigma$-space, a moduli space of fully…
For a zero-relation algebra over a field $\mathcal K$, Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of homomorphisms between two tree modules--the basis elements…
Recollements of triangulated categories may be seen as exact sequences of such categories. Iterated recollements of triangulated categories are analogues of geometric or topological stratifications and of composition series of algebraic…
We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
The concept of $k$-compatibility measures how many phylogenetic trees it would take to display all splits in a given set. A set of trees that display every single possible split is termed a \textit{universal tree set}. In this note, we find…
We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is…
Inspired by Rumin's work on a subcomplex in sub-Riemannian manifolds which is cohomologically equivalent to the de Rham complex, we present a more general construction that produces subcomplexes from any filtered cochain complex of finite…
In this paper we investigate the simplicial structure of a chain complex associated to the higher order Hochschild homology over the $3$-sphere. We also introduce the tertiary Hochschild homology corresponding to a quintuple…
We study the cohomology of forested graph complexes with ordered and unordered hairs whose cohomology computes the cohomology of a family of groups $\Gamma_{g,r}$ that generalize the (outer) automorphism group of free groups. We give…
Let G be a finitely generated group. Two simplicial G-trees are said to be in the same deformation space if they have the same elliptic subgroups (if H fixes a point in one tree, it also does in the other). Examples include…
We analyze the trade-off between model complexity and accuracy for random forests by breaking the trees up into individual classification rules and selecting a subset of them. We show experimentally that already a few rules are sufficient…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…
We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages…
Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…
While chain complexes are equipped with a differential $d$ satisfying $d^2 = 0$, their generalizations called $N$-complexes have a differential $d$ satisfying $d^N = 0$. In this paper we show that the lax nerve of the category of chain…