Plant cover
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
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
- ↑ D. M. Ryan, B. A. Foster, An Integer Programming Approach to Scheduling, p.274, University of Auckland, 1981.