How Can We Help?
You are here:
< Back
An m-by-n binary matrix that has no possible k-by-k submatrix K
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
- ^ D. M. Ryan, B. A. Foster, An Integer Programming Approach to Scheduling, p.274, University of Auckland, 1981.
Categories
-
Annuals36
-
Bulbs, Corms & Tubers41
-
Ferns27
-
Fruits3
-
Garden Plants23
-
Grasses26
-
Herb17
-
Insects1
-
Mammals1
-
Midwest Native Plants0
-
Northeast Native Plants112
-
Perennials123
-
Rose1
-
Shrubs47
-
Trees112
-
Tropical Plants53
-
Upland Birds5
-
Vines18
-
Viola Tricolor1
-
Water Gardening & Plants9
-
Waterfowl0
-
Wetland Birds0
-
Wetland Plants4
-
Wildbirds172
-
Wildflowers1
-
Woodland Plants29
Table of Contents
Recent Comments