Abstract
We give a signed generalization of Laurent's theorem that characterizes feasible positive semidefinite matrix completion problems in terms of metric polytopes. Based on this result, we give a characterization of the maximum rank completions of the signed positive semidefinite matrix completion problem for odd- minor free signed graphs. The analysis can also be used to bound the minimum rank over the completions and to characterize uniquely solvable completion problems for odd- minor free signed graphs. As a corollary we derive a characterization of the universal rigidity of odd- minor free spherical tensegrities, and also a characterization of signed graphs whose signed Colin de Verdière parameter is bounded by two, recently shown by Arav et al.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.