The finite-completion characterization for low-rank matrix patterns
Statement
Let be a matrix-observation pattern, let be the target rank, and suppose that every row and column of contains at least entries equal to . A rank- matrix is generic if its entries are sufficiently general, and a rank- completion of the observations of at is a rank- matrix agreeing with on those observed entries. Condition ii) of Theorem is the combinatorial condition stated in the source.
Finite-completion conjecture. Without loss of generality, let the number of 's at every row and column of be at least . Then a generic rank- matrix observed at has finitely many rank- completions if and only if satisfies condition ii) of Theorem.
The conjecture proposes that, after excluding rows and columns with too few observations, condition ii) exactly characterizes finite completability. The source notes that uniquely completable patterns exist beyond the sufficient condition of Theorem, but reports no counterexample to this finite-completion characterization.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.