TY - JOUR T1 - Reconstruction of discrete sets with absorption JF - Linear Algebra and its Applications Y1 - 2001 A1 - Attila Kuba A1 - Maurice Nivat AB -

The uniqueness problem is considered when binary matrices are to be reconstructed from their absorbed row and column sums. Let the absorption coefficient n be selected such that en = (1+5^0.5)/2. Then it is proved that if a binary matrix is non-uniquely determined, then it contains a special pattern of 0s and 1s called composition of alternatively corner-connected components. In a previous paper [Discrete Appl. Math. (submitted)] we proved that this condition is also sufficient, i.e., the existence of such a pattern in the binary matrix is necessary and sufficient for its non-uniqueness.

VL - 339 UR - http://www.sciencedirect.com/science/article/B6V0R-44CHW26-C/2/e4cd2b3dc91dbb828db15e331a6230cc ER -