The Euclidean distance matrix for distinct points in โ is generically of rank + 2. It is shown in this paper via a geometric argument that its nonnegative rank for the case = 1 is generically .
On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
โ Scribed by A.Y. Alfakih
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 116 KB
- Volume
- 416
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let e P p nรn , f P p nรt , where F is an arbitrary ยฎeld. We describe the possible characteristic polynomials of e f, when some of its rows are prescribed and the other rows vary. The characteristic polynomial of e f is deยฎned as the largest determinantal divisor (or the product of the invariant fac
In this paper we obtain new characterizations of the faces of the cone of Euclidean distance matrices. In one case the characterization is based on a special subspace associated with each distance matrix, in other case on linear restrictions of coordinate matrices. We also relate the faces to the su