# The Entries of EDMs

## Abstract

This chapter focuses on two problems concerning the individual entries of an EDM. The first problem is how to determine a missing or an unknown entry of an EDM. We present two methods for solving this problem, the second of which yields a complete closed-form solution. The second problem is how far an entry of an EDM can deviate from its current value, assuming all other entries are kept unchanged, before the matrix stops being an EDM. We present explicit formulas for the intervals, within which, entries can vary, one at a time, if the matrix is to remain an EDM. Moreover, we present a characterization of those entries whose intervals have zero length; i.e., those entries where any deviation from their current values renders the matrix non-EDM.

## References

- 15.A.Y. Alfakih, On yielding and jointly yielding entries of Euclidean distance matrices. Linear Algebra Appl.
**556**, 144–161 (2018)MathSciNetCrossRefGoogle Scholar - 31.M. Bakonyi, C.R. Johnson, The Euclidean distance matrix completion problem. SIAM J. Matrix Anal. Appl.
**16**, 646–654 (1995)MathSciNetCrossRefGoogle Scholar