The present paper continues the work begun by Anstee, Ferguson, Griggs and Sali on small forbidden configurations. We define a matrix to be simple if it is a (0,1)-matrix with no repeated columns. Let F be a k× l (0,1)-matrix (the forbidden configuration). Assume A is an m×n simple matrix which has no submatrix which is a row and column permutation of F . We define forb(m,F ) as the largest n, which would depend on m and F , so that such an A exists. ‘Small’ refers to the size of k and in this paper k = 2. For p ≤ q, we set Fpq to be the 2 × (p + q) matrix with p 1 0 ] ’s and q 0 1 ] ’s. We give new exact values: forb(m,F0,4) = b 5m 2 c + 2, forb(m,F1,4) = b 11m 4 c + 1, forb(m,F1,5) = b 15m 4 c + 1, forb(m,F2,4) = b 10m 3 − 4 3c and forb(m,F2,5) = 4m (For forb(m,F1,4), forb(m,F1,5) we obtain equality only for certain classes modulo 4). In addition we provide a surprising construction which shows forb(m,Fpq) ≥ p+q 2 + O(1) ) m.
[1]
Gábor Tardos,et al.
On 0-1 matrices and small excluded submatrices
,
2005,
J. Comb. Theory, Ser. A.
[2]
Marek Karpinski,et al.
VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
,
1993,
SIAM J. Comput..
[3]
Jirí Matousek,et al.
Bounded VC-Dimension Implies a Fractional Helly Theorem
,
2004,
Discret. Comput. Geom..
[4]
Richard P. Anstee,et al.
Small Forbidden Configurations II
,
2000,
Electron. J. Comb..
[5]
Richard P. Anstee,et al.
Small Forbidden Configurations
,
1997,
Graphs Comb..