Forbidden configurations: Induction and linear algebra (Q1898049)

Recall that an \(m \times m\) matrix \(A\) with 0's and 1's as entries is called simple if no column of \(A\) is repeated. Let \({\mathcal F}\) be a set of matrices. We say \(A\) has a forbidden configuration with respect to \({\mathcal F}\) if there is a submatrix of \(A\) which, after a possible reordering of the rows and columns, is in \({\mathcal F}\). In this article, Anstee provides some further results from his studies about `forbidden configurations'. Earlier work by the author about this subject has appeared in [J. Comb. Theory, Ser. A 40, No. 1, 108-124 (1985; Zbl 0619.05015)] and in [J. Comb. Theory, Ser. A 47, No. 1, 16-27 (1988; Zbl 0672.05003)].