Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-27T10:53:02.487Z Has data issue: false hasContentIssue false
  • English
  • Français

Combinatorial solution of certain systems of linear equations involving (0,1) matrices

Published online by Cambridge University Press:  09 April 2009

W. E. Longstaff
W. E. Longstaff
Affiliation:
Department of Mathematics, The University of Western Australia, Nedlands, W.A., 6009, Australia.
Rights & Permissions [Opens in a new window]

Abstract

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.

If m and n are natural numbers satisfying 1 ≦ m < n let denote the least integer k such that the statement: ‘Every (0,1) matrix with n columns, with constant row-sum m, and with at least k distinct rows, has rank n’ is true. Then = +1 for m ≧ 2, n ≧ m2 + 2. Further, for 1 ≦ m < n.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 23 , Issue 3 , May 1977 , pp. 266 - 274
Copyright
Copyright © Australian Mathematical Society 1977