1 problem

Let $T$ be any $k\times k$ triangular $0$-$1$ matrix with all ones on the diagonal. For an $m\times n$ matrix, let $\operatorname{sat}(m,n,T)$ be the minimum number of $1$ entries…