加载中…
Keszegh (2009) proved that the extremal function of any forbidden light -dimensional 0-1 matrix is at most quasilinear in , using a reduction to generalized Davenport-Schinzel sequences. We extend this result to multidimensional matrices by proving that any light -dimensional 0-1 matrix has extremal function for some constant that depends on . To prove this result, we introduce a new family of patterns called $(P, s)(r, s)$-formations, and we prove upper bounds on their extremal functions. In many cases, including permutation matrices with at least two ones, we are able to show that our $(P, s)$-formation upper bounds are tight.

生成讲解博客的中文版本

生成AI智能校验的中文版本