The relationship between the class %plane1D;518;2(R,S) of (0,1,2)-matrices and the collection of constellation matrices Original Research Article

Let %plane1D;518;2(R,S) be the class of all (0, 1, 2)-matrices with a prescribed row sum vector R and column sum vector S. A (0, 1,2)-matrix in %plane1D;518;2(R,S) is defined to be parsimonious provided no (0, 1, 2)-matrix with the same row and column sum vectors has fewer positive entries. In a parsimonious (0, 1, 2)-matrix A there are severe restrictions on the (0, 1)-matrix A(1) which records the positions of the 1ʹs in A. Brualdi and Michael obtained some necessary arithmetic conditions for a set of matrices to serve simultaneously as the 1-pattern matrices for parsimonious matrices in a given class. In this paper, we provide a direct construction that proves that these conditions are also sufficient.