Triangular ranks do not bound minimum ranks in matrix completion

DOI10.2140/tunis.2024.6.543MaRDI QIDQ6631544

Yaroslav N. Shitov

Publication date: 1 November 2024

Published in: Tunisian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

matrix completiontriangular minimal rank

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Matrix completion problems (15A83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lower order of lower triangular operators and minimal rank extensions
• Toeplitz minimal rank completions
• Matrix completions and chordal graphs
• Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
• Symmetric completions of cycles and bipartite graphs
• Typical and generic ranks in matrix completion
• Completion of tree metrics and rank 2 matrices
• Three remarks on spectra of zero-nonzero patterns
• Orthogonal representations over finite fields and the chromatic number of graphs
• Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
• Minimum rank completions
• Several results on chordal bipartite graphs
• Minimal rank completions of partial banded matrices
• Fractional minimal rank
• The cyclic rank completion problem with general blocks
• A separation between tropical matrix ranks
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Kapranov rank vs. tropical rank
• On a problem of K. Zarankiewicz

This page was built for publication: Triangular ranks do not bound minimum ranks in matrix completion