AbstractWe present a characterization of the nullspace and the rangespace of a Euclidean distance matrix (EDM) D in terms of the vector of all ones, and in terms of the Gale subspace G(D) and the realization matrix P corresponding to D. This characterization is then used to compute the characteristic polynomial of D. We also present some results concerning EDMs generated by regular figures and EDMs generated by centrally symmetric points
17 pagesInternational audienceWe review the relations between distance matrices and isometric embedd...
AbstractIn this paper we obtain new characterizations of the faces of the cone of Euclidean distance...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
AbstractWe present a characterization of the nullspace and the rangespace of a Euclidean distance ma...
AbstractA regular figure (which includes all regular polygons) is a set of points on a hypersphere w...
AbstractA new characterization of the faces of the cone of Euclidean distance matrices (EDMs) was re...
AbstractWe present a characterization of those Euclidean distance matrices (EDMs) D which can be exp...
AbstractThe geometry of the cone of Euclidean distance matrices (EDMs) is analyzed using a new chara...
AbstractWe study the structure of circum-Euclidean distance matrices, those Euclidean distance matri...
A distance matrix D of order n is symmetric with elements , where dii=0. D is Euclidean when the qu...
AbstractIn this paper we obtain new characterizations of the faces of the cone of Euclidean distance...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
AbstractA distance matrix D of order n is symmetric with elements −12dij2, where dii=0. D is Euclide...
AbstractProperties of the eigenvalues of the distance matrix of a one dimensional point set are deri...
In this paper, the notion of equitable partitions (EP) is used to study the eigenvalues of Euclidean...
17 pagesInternational audienceWe review the relations between distance matrices and isometric embedd...
AbstractIn this paper we obtain new characterizations of the faces of the cone of Euclidean distance...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
AbstractWe present a characterization of the nullspace and the rangespace of a Euclidean distance ma...
AbstractA regular figure (which includes all regular polygons) is a set of points on a hypersphere w...
AbstractA new characterization of the faces of the cone of Euclidean distance matrices (EDMs) was re...
AbstractWe present a characterization of those Euclidean distance matrices (EDMs) D which can be exp...
AbstractThe geometry of the cone of Euclidean distance matrices (EDMs) is analyzed using a new chara...
AbstractWe study the structure of circum-Euclidean distance matrices, those Euclidean distance matri...
A distance matrix D of order n is symmetric with elements , where dii=0. D is Euclidean when the qu...
AbstractIn this paper we obtain new characterizations of the faces of the cone of Euclidean distance...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
AbstractA distance matrix D of order n is symmetric with elements −12dij2, where dii=0. D is Euclide...
AbstractProperties of the eigenvalues of the distance matrix of a one dimensional point set are deri...
In this paper, the notion of equitable partitions (EP) is used to study the eigenvalues of Euclidean...
17 pagesInternational audienceWe review the relations between distance matrices and isometric embedd...
AbstractIn this paper we obtain new characterizations of the faces of the cone of Euclidean distance...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...