Jump to content

Perfect matrix

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Addbot (talk | contribs) at 17:14, 21 March 2013 (Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q7168088). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, a perfect matrix is an m-by-n binary matrix that has no possible k-by-k submatrix K that satisfies the following conditions:[1]

  • k > 3
  • the row and column sums of K are each equal to b, where b ≥ 2
  • there exists no row of the (m − k)-by-k submatrix formed by the rows not included in K with a row sum greater than b.

The following is an example of a K submatrix where k = 5 and b = 2:

References

  1. ^ D. M. Ryan, B. A. Foster, An Integer Programming Approach to Scheduling, p.274, University of Auckland, 1981.