Related papers: Trees meet octahedron comparison
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.
We show that, under suitably general formulations, covering properties, accumulation properties and filter convergence are all equivalent notions. This general correspondence is exemplified in the study of products. Let $X$ be a product of…
Given two non-empty graphs $H$ and $T$, write $H\succcurlyeq T$ to mean that $t(H,G)^{|E(T)|}\geq t(T,G)^{|E(H)|}$ for every graph $G$, where $t(\cdot,\cdot)$ is the homomorphism density function. We obtain various necessary and sufficient…
We found a necessary and sufficient condition for the existence of the tensor product of modules over a vertex algebra. We defined the notion of vertex bilinear map and we provide two algebraic construction of the tensor product, where one…
We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…
This work considers a number of optimization problems and reductive relations between them. The two main problems we are interested in are the \emph{Optimal Decision Tree} and \emph{Set Cover}. We study these two fundamental tasks under…
Galled trees, directed acyclic graphs that model evolutionary histories with isolated hybridization events, have become very popular due to both their biological significance and the existence of polynomial time algorithms for their…
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…
Comparisons of single-cell RNA sequencing (scRNA-seq) data across species can reveal links between cellular gene expression and the evolution of cell functions, features, and phenotypes. These comparisons invoke evolutionary histories, as…
We find sufficient conditions under which the product of spaces that have a $\pi$-tree also has a $\pi$-tree. These conditions give new examples of spaces with a $\pi$-tree: every at most countable power of the Sorgenfrey line and every at…
We prove that a certain $\omega$-category, which was constructed in previous work by the third and fourth author, is a model for the fully coherent walking $\omega$-equivalence. Further, appropriate truncations of it give models for the…
We study the category whose objects are trees (with or without roots) and whose morphisms are contractions. We show that the corresponding contravariant module categories are Noetherian, and we study two natural families of modules over…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…
In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the data structure. We give some new definitions to previously well-defined concepts that…
We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…
We say that a finitely generated group $G$ has property (QT) if it acts isometrically on a finite product of quasi-trees so that orbit maps are quasi-isometric embeddings. A quasi-tree is a connected graph with path metric quasi-isometric…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
There are many different crossed products by an endomorphism of a C*-algebra, and constructions by Exel and Stacey have proved particularly useful. Here we show that every Exel crossed product is isomorphic to a Stacey crossed product,…