Related papers: High-Dimensional Simplexes for Supermetric Search

The goal of this paper is to introduce and study analogues of the Euclidean Funk and Hilbert metrics on open convex subsets $\Omega$ of hyperbolic or spherical spaces. At least at a formal level, there are striking similarities among the…

The knowledge that data lies close to a particular submanifold of the ambient Euclidean space may be useful in a number of ways. For instance, one may want to automatically mark any point far away from the submanifold as an outlier or to…

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

This paper demonstrates that random, independently chosen equi-dimensional subspaces with a unitarily invariant distribution in a real Hilbert space provide nearly tight, nearly equiangular fusion frames. The angle between a pair of…

Shape metrics for objects in high dimensions remain sparse. Those that do exist, such as hyper-volume, remain limited to objects that are better understood such as Platonic solids and $n$-Cubes. Further, understanding objects of ill-defined…

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

We give a new proof of a theorem of Kleiner-Leeb: that any quasi-isometrically embedded Euclidean space in a product of symmetric spaces and Euclidean buildings is contained in a metric neighborhood of finitely many flats, as long as the…

A subset of points in a metric space is said to resolve it if each point in the space is uniquely characterized by its distance to each point in the subset. In particular, resolving sets can be used to represent points in abstract metric…

In this note we link symplectic and convex geometry by relating two seemingly different open conjectures: a symplectic isoperimetric-type inequality for convex domains, and Mahler's conjecture on the volume product of centrally symmetric…

This paper investigates minimal $n$-dimensional submanifolds in the Euclidean space that are $(n-2)$-umbilic, meaning they carry an umbilical distribution of rank $n-2$. We establish a correspondence between the class of minimal…

We build polyhedral complexes in Rn that coincide with dyadic grids with different orientations, while keeping uniform lower bounds (depending only on n) on the flatness of the added polyhedrons including their subfaces in all dimensions.…

In ``Characterization, stability and convergence of hierarchical clustering methods'' by G. E. Carlsson, F. Memoli, the natural way to construct an ultrametric space from a given metric space was presented. It was shown that the…

In 1980, Onishchik introduced the index of a Riemannian symmetric space as the minimal codimension of a (proper) totally geodesic submanifold. He calculated the index for symmetric spaces of rank less than or equal to 2, but for higher rank…

An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…

Let $X$ be an $n$-point subset of a Euclidean space and $0 < a < 1$. The classical theorem of Schoenberg implies that the snowflake space $X^a$ can be isometrically embedded into Euclidean space. In the paper we show that points in the…

From a sufficiently large point sample lying on a compact Riemannian submanifold of Euclidean space, one can construct a simplicial complex which is homotopy-equivalent to that manifold with high confidence. We describe a corresponding…

A metric space $(X,d)$ has the de Groot property $GP_n$ if for any points $x_0,x_1,...,x_{n+2}\in X$ there are positive indices $i,j,k\le n+2$ such that $i\ne j$ and $d(x_i,x_j)\le d(x_0,x_k)$. If, in addition, $k\in\{i,j\}$ then $X$ is…

In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…

We prove rigidity for hypersurfaces with boundary in the unit $(n+1)$-sphere with scalar curvature bounded below by $n(n-1)$. Under appropriate boundary conditions, the hypersurfaces are shown to be part of the equatorial spheres. The lower…

We propose a framework for 2D shape analysis using positive definite kernels defined on Kendall's shape manifold. Different representations of 2D shapes are known to generate different nonlinear spaces. Due to the nonlinearity of these…