Related papers: Uniformly continuous maps between ends of R-trees
We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…
Using the notion of modulus of continuity at a point of a mapping between metric spaces, we introduce the notion of extensively bounded mappings generalizing that of Lipschitz mappings. We also introduce a metric on it which becomes a norm…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm. We provide a quantitative form of this result, calculating the…
This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…
The category of metric spaces is a subcategory of quasi-metric spaces. In this paper the notion of entropy for the continuous maps of a quasi-metric space is extended via spanning and separated sets. Moreover, two metric spaces that are…
Merge trees are a topological descriptor of a filtered space that enriches the degree zero barcode with its merge structure. The space of merge trees comes equipped with an interleaving distance $d_I$, which prompts a naive question: is the…
This note tries to give an answer to the following question: Is there a sufficiently rich class of metric vector spaces such that sufficiently large spaces of continuous linear maps between them are metrizable?
In ``Rips complexes and covers in the uniform category'' the authors define, following James, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform…
We generalize some results of Borwein, Burke, Lewis, and Wang to mappings with values in metric (resp. ordered normed linear) spaces. We define two classes of monotone mappings between an ordered linear space and a metric space (resp.…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
We consider groups $\mathbb{I}$ of isometries of ultrametric Urysohn spaces $\mathbb{U}$. Such spaces $\mathbb{U}$ admit transparent realizations as boundaries of certain $R$-trees and the groups $\mathbb{I}$ are groups of automorphisms of…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
It is well-known that quasi-isometries between R-trees induce power quasi-symmetric homeomorphisms between their ultrametric end spaces. This paper investigates power quasi-symmetric homeomorphisms between bounded, complete, uniformly…
WWe define the notion of a random metric space and prove that with probability one such a space is isometricto the Urysohn universal metric space. The main technique is the study of universal and random distance matrices; we relate the…
This is the first of a series of papers which are devoted to a comprehensive theory of maps between orbifolds. In this paper, we define the maps in the more general context of orbispaces, and establish several basic results concerning the…
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?…