Related papers: Dimensions of tight spans
Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…
The tight-span of a finite metric space is a polytopal complex that has appeared in several areas of mathematics. In this paper we determine the polytopal structure of the tight-span of a totally split decomposable (finite) metric. Totally…
The definition of $n$-width of a bounded subset $A$ in a normed linear space $X$ is based on the existence of $n$-dimensional subspaces. Although the concept of an $n$-dimensional subspace is not available for metric trees, in this paper,…
We use the trimming transformations to study the tight span of a metric space.
The tight span, or injective envelope, is an elegant and useful construction that takes a metric space and returns the smallest hyperconvex space into which it can be embedded. The concept has stimulated a large body of theory and has…
The smallest hyperconvex metric space containing a given metric space X is called the tight span of X. It is known that tight spans have many nice geometric and topological properties, and they are gradually becoming a target of research of…
The tight span $T_d$ of a metric $d$ on a finite set is the subcomplex of bounded faces of an unbounded polyhedron defined by~$d$. If $d$ is generic then $T_d$ is known to be dual to a regular triangulation of a second hypersimplex. A tight…
The strong vertex (edge) span of a given graph $G$ is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of $G$ and moving either to an adjacent vertex or staying in the current position…
The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in…
Chain distance between points in a metric space is defined as the infimum of epsilon such that there is an epsilon-chain connecting these points. We call a mapping of a metric compact into the real line a chain development if it preserves…
A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…
An extension $(V,d)$ of a metric space $(S,\mu)$ is a metric space with $S \subseteq V$ and $d|_S = \mu$, and is said to be tight if there is no other extension $(V,d')$ of $(S,\mu)$ with $d' \leq d$. Isbell and Dress independently found…
Let (X,d) be a finite metric space. This paper first discusses the spectrum of the p-distance matrix of a finite metric space of p-negative type and then gives upper and lower bounds for the so called gap of a finite metric space of strict…
The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are. Here it is shown how to extend that definition, and in particular the…
Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by others, most notably by Dress, who gave them this name. Subsequently, it was found that tight-spans could be defined for more general maps, such…
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…
The magnitude of a metric space is a novel invariant that provides a measure of the 'effective size' of a space across multiple scales, while also capturing numerous geometrical properties, such as curvature, density, or entropy. We develop…
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…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
The problem of realizing finite metric spaces in terms of weighted graphs has many applications. For example, the mathematical and computational properties of metrics that can be realized by trees have been well-studied and such research…