Related papers: Trees meet octahedron comparison
A quasiconformal tree is a metric tree that is doubling and of bounded turning. We prove that every quasiconformal tree is quasisymmetrically equivalent to a geodesic tree with Hausdorff dimension arbitrarily close to 1.
Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…
In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to…
In the $L_0$ Fitting Tree Metrics problem, we are given all pairwise distances among the elements of a set $V$ and our output is a tree metric on $V$. The goal is to minimize the number of pairwise distance disagreements between the input…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of…
We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.
Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological…
We show that, for any graph or matroid, there is a tree that simultaneously distinguishes its maximal tangles, and, for each maximal tangle $\mathcal{T}$ that satisfies an additional robustness condition, displays all of the non-trivial…
We introduce tropical corals, balanced trees in a half-space, and show that they correspond to holomorphic polygons capturing the product rule in Lagrangian Floer theory for the elliptic curve. We then prove a correspondence theorem…
Since they became observable, neuron morphologies have been informally compared with biological trees but they are studied by distinct communities, neuroscientists, and ecologists. The apparent structural similarity suggests there may be…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We…
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…
We propose a novel technique, termed compact shape trees, for computing correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero or more features defined at each of n sample points on the shape's boundary, the compact…
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…
We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.