Contents

-

Double Orderings of (0,1)-Matrices

Adolf Mader1, Otto Mutzbauer2
1DEPARTMENT OF MATHEMATICS, UNIVERSITY OF HAWAII HOoNoLUuLu, HI 96822adolf@math.hawaii.edu
2MATHEMATISCHES INSTITUT, UNIVERSITAT WURZBURG AM HuBLAND, 97074 WirzBuURG, GERMANY

Abstract

There is a lexicographic ordering of (0,1)-tuples. Thus, the rows of a (0,1)-matrix can be ordered lexicographically decreasing from the top by permutations, or analogously the columns from the left. It is shown that (0,1)-matrices allow a simultaneous ordering of the rows and the columns. Those matrices are called doubly ordered, and their structure is determined. An answer is given to the question of whether a (0,1)-matrix can be transformed into a block diagonal matrix by permutations of the rows and the columns; in fact, the double ordering of a (0,1)-matrix already displays the finest block diagonal structure. Moreover, fast algorithms are presented that double order a (0,1)-matrix.