Related papers: Euclidean distance matrices and separations in com…

This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…

Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…

We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…

We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…

An $n \times n$ matrix D is a Euclidean distance matrix (EDM) if there exist $p^1, \ldots, p^n$ in some Euclidean space such that $d_{ij} = || p^i - p^j||^2$ for all $i,j=1,\ldots,n$. Let D be an EDM and let $E^{ij}$ be the $n \times n$…

We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in…

Let $G$ be a connected graph on $n$ vertices and $d_{ij}$ be the length of the shortest path between vertices $i$ and $j$ in $G$. We set $d_{ii}=0$ for every vertex $i$ in $G$. The squared distance matrix $\Delta(G)$ of $G$ is the $n\times…

For a simple, undirected and connected graph $G$, $D_{\alpha}(G) = \alpha Tr(G) + (1-\alpha) D(G)$ is called the $\alpha$-distance matrix of $G$, where $\alpha\in [0,1]$, $D(G)$ is the distance matrix of $G$, and $Tr(G)$ is the vertex…

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…

Let $G$ be a simple, connected graph, $\mathcal{D}(G)$ be the distance matrix of $G$, and $Tr(G)$ be the diagonal matrix of vertex transmissions of $G$. The distance Laplacian matrix and distance signless Laplacian matrix of $G$ are defined…

The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on…

Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…

Let $n \geq 4$ be an even integer and $W_n$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_n$ is the length of the shortest path connecting $i$ and $j$. Let $D$ be the $n…

In a recent paper, a "distance" function, \cal D, was defined which measures the distance between pure classical and quantum systems. In this work, we present a new definition of a "distance", D, which measures the distance between either…

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…

Let $G$ be a connected graph with vertex set $\{v_1, v_2, \ldots, v_\mathbf{n}\}$. As a variant of the classical distance matrix, the \emph{exponential distance matrix} was introduced independently by Yan and Yeh, and by Bapat et al. For a…

The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices. The transmission of a vertex $v_i$ in $G$ is the sum of the distances from $v_i$ to all other vertices and $T(G)$ is the…

Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…

A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…