Ladder Matrix Recovery from Permutations
arXiv:2207.10864
Abstract
We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative algebra and algebraic geometry, for which we include a preparation as needed for a general audience.
14 double-column pages