Related papers: Distance matrices and isometric embeddings
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
Nontrivial isometric embeddings for flat metrics (i.e., those which are not just planes in the ambient space) can serve as useful tools in the description of gravity in the embedding gravity approach. Such embeddings can additionally be…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
Although recovering an Euclidean distance matrix from noisy observations is a common problem in practice, how well this could be done remains largely unknown. To fill in this void, we study a simple distance matrix estimate based upon the…
In this note, we summarize known results and open questions on the existence of isometric embeddings between different Schatten classes as well as obtain a new non-embeddability result using a novel method. We also provide a brief overview…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
A proof of the isometric embedding of a given two-metric in E^3 of class C^1. The method uses the theory of first order partial differential equations. The curvature of the metric plays no role in the proof.
We show how the Riemannian distance on $\mathbb{S}^n_{++}$, the cone of $n\times n$ real symmetric or complex Hermitian positive definite matrices, may be used to naturally define a distance between two such matrices of different…
In this article, we study holomorphic isometric embeddings between bounded symmetric domains. In particular, we show the total geodesy of any holomorphic isometric embedding between reducible bounded symmetric domains with the same rank.
In this paper, we give a characterization of distance matrices of distance-regular graphs to be invertible.
We show that compact Riemannian manifolds, regarded as metric spaces with their global geodesic distance, cannot contain a number of rigid structures such as (a) arbitrarily large regular simplices or (b) arbitrarily long sequences of…
The generalized distance matrix of a graph is the matrix whose entries depend only on the pairwise distances between vertices, and the generalized distance spectrum is the set of eigenvalues of this matrix. This framework generalizes many…
We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…
We propose a new embedding method for a single vector and for a pair of vectors. This embedding method enables: a) efficient classification and regression of functions of single vectors; b) efficient approximation of distance functions; and…
Suppose that there exists a discrete subset $X$ of a complete, connected, $n$-dimensional Riemannian manifold $M$ such that the Riemannian distances between points of $X$ correspond to the Euclidean distances of a net in $\mathbb{R}^{n}$.…
A finite set of unlabelled points in Euclidean space is the simplest representation of many real objects from mineral rocks to sculptures. Since most solid objects are rigid, their natural equivalence is rigid motion or isometry maintaining…
We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…
We study the differential geometric properties of the manifold of non-singular symmetric real matrices endowed with the trace metric; in case of positive definite matrices we describe the full group of isometries
We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…