Combinatorial Conditions for the Unique Completability of Low-Rank Matrices

DOI10.1137/140960098zbMath1316.15033OpenAlexW1999858916MaRDI QIDQ5246084

Shin-ichi Tanigawa, Bill Jackson, Tibor Jordán

Publication date: 17 April 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/20968/1/CombinatorialCondition.pdf

zbMATH Keywords

bipartite graphpartial matrixGram matrixpositive semidefinite matrixrigidity of graphscompletion problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Matrix completion problems (15A83)

Related Items (4)

Unique low rank completability of partially filled matrices ⋮ Completion of tree metrics and rank 2 matrices ⋮ Maximal matroids in weak order posets ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning

This page was built for publication: Combinatorial Conditions for the Unique Completability of Low-Rank Matrices