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.

翻译：我们为已对其条目进行变换的封闭级矩阵提供独特的回收保障,甚至为更一般的矩阵结构提供这种保障,我们称之为梯子矩阵,我们使用通量代数和代数几何的方法和结果,为此我们根据需要为广大受众做好准备。