Related papers: Tree-like is not a transitive relation on paths
There are numerous generalizations of the celebrated Priestley duality for bounded distributive lattices to the non-distributive setting. The resulting dualities rely on an earlier foundational work of such authors as Nachbin,…
It is shown that if a metric space exhibits certain finiteness and tree-like properties, then elements of its group of bounded displacement which are infinitely divisible are also torsion. This extends a result of N. M. Suchkov, A. A.…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
In a 2013 paper, Cheeger and Kleiner introduced a new type of dimension for metric spaces, the "Lipschitz dimension". We study the dimension-theoretic properties of Lipschitz dimension, including its behavior under Gromov-Hausdorff…
The goal of this paper is to define and inspect a metric version of the universal path space and study its application to purely 2-unrectifiable spaces, in particular the Heisenberg group $\mathbb{H}^1$. The construction of the universal…
The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…
The problem of counting plane trees with $n$ edges and an even or an odd number of leaves was studied by Eu, Liu and Yeh, in connection with an identity on coloring nets due to Stanley. This identity was also obtained by Bonin, Shapiro and…
We estimate the second order linking invariants of Lipschitz maps from an n-dimensional ellipse. The estimate uses a new directionally-dependent version of the isoperimetric inequality for cycles inside the ellipse. Using this work, we…
Two trees in the boundary of outer space are said to be \emph{primitive-equivalent} whenever their translation length functions are equal in restriction to the set of primitive elements of $F_N$. We give an explicit description of this…
Transport networks are crucial to the functioning of natural systems and technological infrastructures. For flow networks in many scenarios, such as rivers or blood vessels, acyclic networks (i.e., trees) are optimal structures when…
We can view the Lipschitz constant as a height function on the space of maps between two manifolds and ask (as Gromov did nearly 30 years ago) what its ``Morse landscape'' looks like: are there high peaks, deep valleys and mountain passes?…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
Let $X$ be a topological space. A subset of $C(X)$, the space of continuous real-valued functions on $X$, is a partially ordered set in the pointwise order. Suppose that $X$ and $Y$ are topological spaces, and $A(X)$ and $A(Y)$ are subsets…
We study the class of quasi-alphabetic relations, i.e., tree transformations defined by tree bimorphisms with two quasi-alphabetic tree homomorphisms and a regular tree language. We present a canonical representation of these relations; as…
We introduce cone bilipschitz equivalences between metric spaces. These are maps, more general than quasi-isometries, that induce a bilipschitz homeomorphism between asymptotic cones. Non-trivial examples appear in the context of Lie…
The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…
The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words. It is well-known that those edges normally do not cross when drawn over the sentence. Here a…
We define a class of properties on random plane trees, which we call subtree additive properties, inspired by the combinatorics of certain biologically-interesting properties in a plane tree model of RNA secondary structure. The class of…
Multiple types can represent the same concept. For example, lists and trees can both represent sets. Unfortunately, this easily leads to incomplete libraries: some set-operations may only be available on lists, others only on trees.…
We show that there are separated nets in the Euclidean plane which are not biLipschitz equivalent to the integer lattice. The argument is based on the construction of a continuous function which is not the Jacobian of a biLipschitz map.