ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ω\Omega be a matrix-observation pattern, let rr be the target rank, and suppose that every row and column of Ω\Omega contains at least r+1r+1 entries equal to 11. A rank-rr matrix XX is generic if its entries are sufficiently general, and a rank-rr completion of the observations of XX at Ω\Omega is a rank-rr matrix agreeing with XX 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 11's at every row and column of Ω\Omega be at least r+1r+1. Then a generic rank-rr matrix XX observed at Ω\Omega has finitely many rank-rr completions if and only if Ω\Omega 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.