Related papers: High-Dimensional Simplexes for Supermetric Search
It has been known since 1970's that the N-dimensional $\ell_1$-space contains nearly Euclidean subspaces whose dimension is $\Omega(N)$. However, proofs of existence of such subspaces were probabilistic, hence non-constructive, which made…
We prove ``half-space" intersection properties in three settings: the hemisphere, half-geodesic balls in space forms, and certain subsets of Gaussian space. For instance, any two embedded minimal hypersurfaces in the sphere must intersect…
We investigate a coarse version of a $2(n+1)$-point inequality characterizing metric spaces of combinatorial dimension at most $n$ due to Dress. This condition, experimentally called $(n,\delta)$-hyperbolicity, reduces to Gromov's quadruple…
We construct a compact metric space that has any other compact metric space as a tangent, with respect to the Gromov-Hausdorff distance, at all points. Furthermore, we give examples of compact sets in the Euclidean unit cube, that have…
One of the oldest and richest problems from continuous location science is the famous Fermat-Torricelli problem, asking for the unique point in Euclidean space that has minimal distance sum to n given (non-collinear) points. Many natural…
Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…
As objects of study in functional analysis, Hilbert spaces stand out as special objects of study as do nuclear spaces in view of a rich geometrical structure they possess as Banach and Frechet spaces, respectively. On the other hand, there…
This paper follows the generalisation of the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$ established by W. M. Schmidt in 1967. Let $A$ and $B$ be two subspaces of $\mathbb{R}^n$ of respective dimensions $d$…
Metric spaces $(X, d)$ are ubiquitous objects in mathematics and computer science that allow for capturing (pairwise) distance relationships $d(x, y)$ between points $x, y \in X$. Because of this, it is natural to ask what useful…
We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…
We prove that the space of persistence diagrams on $n$ points (with the bottleneck or a Wasserstein distance) coarsely embeds into Hilbert space by showing it is of asymptotic dimension $2n$. Such an embedding enables utilisation of Hilbert…
Let $(M,g)$ be an $n$-dimensional asymptotically flat Riemannian manifold with nonnegative scalar curvature that admits a noncompact area-minimizing hypersurface $\Sigma \subset M$. In the case where $n = 3$, O. Chodosh and the first-named…
In a series of papers in the 1960's, S. G\"ahler defined and investigated so-called m-metric spaces and their topological properties. An m-metric assigns to any tuple of m+1 elements a real value (more generally an element in a partially…
Counter-examples to the famous conjecture of Caratheodory, as well as the bound on umbilic index proposed by Hamburger, are constructed with respect to Riemannian metrics that are arbitrarily close to the flat metric on Euclidean 3-space.…
We show that a metric space $X$ that, at every point, has a Gromov-Hausdorff tangent with the splitting property (i.e. every geodesic line splits off a factor $\mathbb{R}$), is universally infinitesimally Hilbertian (i.e. $W^{1,2}(X,\mu)$…
This paper uses W. M. Schmidt's idea formulated in 1967 to generalise the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$. Given two subspaces of $\mathbb{R}^n$ $A$ and $B$ of respective dimensions $d$ and $e$…
Interior-point methods offer a highly versatile framework for convex optimization that is effective in theory and practice. A key notion in their theory is that of a self-concordant barrier. We give a suitable generalization of…
We present an algorithm for the fast computation of the general $N$-point spatial correlation functions of any discrete point set embedded within an Euclidean space of $\mathbb{R}^n$. Utilizing the concepts of kd-trees and graph databases,…
A well-known object in classical Euclidean geometry is the circumcenter of a triangle, i.e., the point that is equidistant from all vertices. The purpose of this paper is to provide a systematic study of the circumcenter of sets containing…
An ultrametric space or infinity-metric space is defined by a dissimilarity function that satisfies a strong triangle inequality in which every side of a triangle is not larger than the larger of the other two. We show that search in…