Homomorphic sensing of subspace arrangements

Ladder Matrix Recovery from Permutations

“…Their main result was that for a generic coefficient matrix, unique recovery of the original solution is possible, as long as at least 2r unordered entries of the right-hand-side vector are given, where r is the dimensionality of the solution. In an algebraic-geometric theory termed homomorphic sensing ( [3], [4], [5]), Peng and the author showed that this phenomenon can be explained from an abstract point of view, for arbitrary linear transformations of the right-hand-side vector.…”