Jump to content

Perfect matrix

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ozzah (talk | contribs) at 22:41, 24 October 2010 (Created page with 'In mathematics, a '''perfect matrix''' is an ''m''-by-''n'' binary matrix which has no possible ''k''-by-''k'' submatrix '''K''' which satisfies the fol...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

  • 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: