Article contents
Minimal Term Rank of a Class of (0, 1)-Matrices
Published online by Cambridge University Press: 20 November 2018
Extract
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
- Copyright
- Copyright © Canadian Mathematical Society 1963
References
- 5
- Cited by