Distance Matrix Completions

Explore a 44-minute lecture on distance matrix completions presented by Charles Johnson from the College of William and Mary. Delve into the concept of partial matrices and their completions, focusing on the P-completion problem for matricial properties. Examine the semi-algebraic nature of distance matrices and their completions, with particular attention to Euclidean distance matrices. Investigate patterns where distance completable partial matrices are equivalent to partial distance matrices, and understand their geometric implications. Learn about the special spectral properties of distance matrices and gain insights into the Euclidean distance inverse eigenvalue problem. This talk, part of the Workshop on Distance Geometry, Semidefinite Programming and Applications, offers a deep dive into the mathematical intricacies of distance matrices and their completions.