Hostname: page-component-77c89778f8-n9wrp Total loading time: 0 Render date: 2024-07-24T17:33:07.705Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimal Term Rank of a Class of (0, 1)-Matrices

Published online by Cambridge University Press:  20 November 2018

Robert M. Haber
Robert M. Haber*
Affiliation:
Case Institute of Technology
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let be the class of m × n matrices all of whose entries are either 0 or 1 where every matrix A in the class satisfies the conditions that row i of A has ri ones, i = 1, 2, . . . , m; and column j of A has sj ones, j = 1, 2, . . . , n. We let R = (r1 . . . , rm), S = (s1, . . . , sn), and assume that r1 ≥ r2 ≥ . . . ≥ rm ≥ 0; s1 ≥ s2 ≥ . . . ≥ sn > 0. When this is the case we say the class is normalized.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 15 , 1963 , pp. 188 - 192
Copyright
Copyright © Canadian Mathematical Society 1963

References

1. Fulkerson, D. R. and Ryser, H. J., Widths and heights of (0, 1) matrices, Can. J. Math., 13 (1961), 239–255.Google Scholar
2. Haber, R. M., Term rank of 0, 1 matrices, Rend. Sem. Mat. Padova, 30 (1960), 24–51.Google Scholar
3. Ryser, H. J., Combinational properties of matrices of zeros and ones, Can. J. Math. 9 (1957), 371–377.Google Scholar
4. Ryser, H. J., The term rank of a matrix, Can. J. Math. 10 (1958), 57–65.Google Scholar
5. Ryser, H. J., Traces of matrices of zeros and ones, Can. J. Math. 12 (1960), 463–476.Google Scholar
6. Ryser, H. J., Matrices of zeros and ones, Bull. Amer. Math. Soc. 66 (1960), 442–464.Google Scholar