On the uniqueness of Euclidean distance matrix completions. (Q1405021)

An \(n\times n\) real matrix \(D=(d_{ij})\) is called a Euclidean distance matrix iff there exist points \(x^1,x^2,\ldots ,x^n\) in some Euclidean space such that \(d_{ij}=\| x^i-x^j\| ^2\) for all \(i,j=1,2,\ldots ,n.\) An \(n\times n\) real matrix \(A=(a_{ij})\) is called symmetric partial matrix if only some of its entries are specified and if \(a_{kl}\) is specified then \(a_{lk}=a_{kl}.\) The Euclidean distance matrix completion problem is the problem of determining whether or not a given symmetric partial matrix can be completed into a Euclidean distance matrix. This completion is not always unique. In this paper the author presents some necessary and sufficient conditions in terms of Gale transforms of the points \(x^i\) for this completion to be unique.