Abstract
The present paper continues the work begun by Anstee, Ferguson, Griggs, Kamoosi and Sali on small forbidden configurations. We define a matrix to besimpleif it is a (0, 1)-matrix with no repeated columns. LetFbe ak× (0, 1)-matrix (the forbidden configuration). AssumeAis anm×nsimple matrix which has no submatrix which is a row and column permutation ofF. We define forb (m, F) as the largestn, which would depend onmandF, so that such anAexists.DefineFabcdas the (a+b+c+d) × 2 matrix consisting ofarows of [11],brows of [10],crows of [01] anddrows of [00]. With the exception ofF2110, we compute forb (m; Fabcd) for all 4 × 2Fabcd. A number of cases follow easily from previous results and general observations. A number follow by clever inductions based on a single column such as forb (m; F1111) = 4m− 4 and forb (m; F1210) = forb (m; F1201) = forb (m; F0310) = (2m)+m+ 2 (proofs are different). A different idea proves forb (m; F0220) = (2m) + 2m− 1 with the forbidden configuration being related to a result of Kleitman. Our results suggest that determining forb (m; F2110) is heavily related to designs and we offer some constructions of matrices avoidingF2110using existing designs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
