Related papers: A note on extensions of approximate ultrametrics
We construct a multiset space $\mathbb{N}[X]$ over a metric space $X$ that simultaneously enjoys desirable topological properties and admits a natural matching metric $d_{\mathbb{N}[X]}$, making it a metrizable abelian topological monoid…
A densely-defined symmetric linear map from/to a real Hilbert space extends to a self-adjoint map. Extension is expressed via Riesz representation. For a case including Friedrichs extension of a strongly monotone map, self-adjoint extension…
A common approach to implementing similarity search applications is the usage of distance functions, where small distances indicate high similarity. In the case of metric distance functions, metric index structures can be used to accelerate…
Necessary and sufficient quantitative geometric conditions are given for an unbounded set A in a euclidean space R^n to have the following property with a given c > 0: For every s > 0 and for every s-nearisometry f: A -> R^n there is an…
Isometries of metric spaces $(X,d)$ preserve all level sets of $d$. We formulate and prove cases of a conjecture asserting if $X$ is a complete Riemannian manifold, then a function $f:X \rightarrow X$ preserving at least one level set…
Metrics in Grassmannians, or distances between subspaces of same dimension, have many uses, and extending them to the Total Grassmannian of subspaces of different dimensions is an important problem, as usual extensions lack good properties…
The main result of this article is a geometric interpretation of magnitude, a real-valued invariant of metric spaces. We introduce a Euclidean embedding of a (suitable) finite metric space $X$ such that the magnitude of $X$ can be expressed…
It is proved that for every stratifiable space $Y$ and a closed subset $X\subset Y$ there exists a regular (i.e. linear positive with unit norm) extension operator $T:C(X\times X)\to C(Y\times Y)$ preserving the class of (pseudo)metrics.…
We study a new bi-Lipschitz invariant \lambda(M) of a metric space M; its finiteness means that Lipschitz functions on an arbitrary subset of M can be linearly extended to functions on M whose Lipschitz constants are enlarged by a factor…
A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations.…
Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We overview the theory of classical MDS, along with its…
We introduce a fractal dimension for a metric space defined in terms of the persistent homology of extremal subsets of that space. We exhibit hypotheses under which this dimension is comparable to the upper box dimension; in particular, the…
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high…
In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.
In a separably connected space any two points are contained in a separable connected subset. We show a mechanism that takes a connected bounded metric space and produces a complete connected metric space whose separablewise components form…
An ordinal-valued metric taking its values in the set of all countable ordinals can be assigned to a metrizable set of nodes in a transfinite graph. Then, a variety of results concerning nodal eccentricities, radii, diameters, centers,…
We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…
In this survey we aim to give a comprehensive overview of results using sublinear expanders. The term sublinear expanders refers to a variety of definitions of expanders, which typically are defined to be graphs $G$ such that every…
We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…
A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…