AbstractWe study the existence of (0,1)-matrices with given line sums and a fixed zero block. An algorithm is given to construct such a matrix which is based on three applications of the well-known Gale–Ryser algorithm for constructing (0,1)-matrices with given line sums. A characterization in terms of a certain “structure matrix” is proved. Further properties of this structure matrix are also established, and its rank is determined and interpreted combinatorially
This paper is concerned with (0, 1)-normal matrices. The main objective is to study the structure an...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
AbstractThis paper is concerned with (0, 1)-normal matrices. The main objective is to study the stru...
AbstractWe study the existence of (0,1)-matrices with given line sums and a fixed zero block. An alg...
AbstractGale and Ryser have given a necessary and sufficient condition for the existence of a matrix...
AbstractWe study (0, 1)-matrices which contain no triangles (submatrices of order 3 with row and col...
AbstractWe address the problem of explicitly constructing an n×n (0, 1) matrix with constant line su...
AbstractThis paper explicitly constructs non-singular 0-1 matrices of dimensions n with constant row...
Let R and S be non-negative and non-increasing vectors of order m and n respectively. We consider th...
The MATRIX PACKING DOWN problem asks to find a row permutation of a given (0,1)-matrix in such a wa...
The MATRIX PACKING DOWN problem asks to find a row permutation of a given (0,1)-matrix in such a wa...
AbstractThis paper gives a reduced formula for the precise number of matrices in A(R,S), the class o...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
This paper is concerned with (0, 1)-normal matrices. The main objective is to study the structure an...
AbstractGale and Ryser have given a necessary and sufficient condition for the existence of a matrix...
This paper is concerned with (0, 1)-normal matrices. The main objective is to study the structure an...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
AbstractThis paper is concerned with (0, 1)-normal matrices. The main objective is to study the stru...
AbstractWe study the existence of (0,1)-matrices with given line sums and a fixed zero block. An alg...
AbstractGale and Ryser have given a necessary and sufficient condition for the existence of a matrix...
AbstractWe study (0, 1)-matrices which contain no triangles (submatrices of order 3 with row and col...
AbstractWe address the problem of explicitly constructing an n×n (0, 1) matrix with constant line su...
AbstractThis paper explicitly constructs non-singular 0-1 matrices of dimensions n with constant row...
Let R and S be non-negative and non-increasing vectors of order m and n respectively. We consider th...
The MATRIX PACKING DOWN problem asks to find a row permutation of a given (0,1)-matrix in such a wa...
The MATRIX PACKING DOWN problem asks to find a row permutation of a given (0,1)-matrix in such a wa...
AbstractThis paper gives a reduced formula for the precise number of matrices in A(R,S), the class o...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
This paper is concerned with (0, 1)-normal matrices. The main objective is to study the structure an...
AbstractGale and Ryser have given a necessary and sufficient condition for the existence of a matrix...
This paper is concerned with (0, 1)-normal matrices. The main objective is to study the structure an...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
AbstractThis paper is concerned with (0, 1)-normal matrices. The main objective is to study the stru...