Almost maximally rigid non-closedness conjecture

From papers

Let LSn(r,s)\operatorname{LS}_n(r,s) denote the set of matrices that can be written as the sum of an n×nn\times n matrix of rank at most rr and an n×nn\times n matrix with at most ss nonzero entries. Almost maximally rigid non-closedness conjecture. The low-rank plus sparse set LSn(r,s)\operatorname{LS}_n(r,s) is not closed provided

nr+(s+1)1/2,n \geq r + (s+1)^{1/2},

for s[1,(n1)21]s \in [1,(n-1)^2-1] and r[1,n2]r \in [1,n-2]. This would generalize the established non-closedness of LS3(1,3)\operatorname{LS}_3(1,3) to the highest sparsities allowed by the stated bounds, but the general case remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jared Tanner, Andrew Thompson and Simon Vary, “Matrix rigidity and the ill-posedness of Robust PCA and matrix completion”, arXiv:1811.05919 (2019).

Solutions 0

No solutions have been posted yet.