Papers
Topics
Authors
Recent
Search
2000 character limit reached

Forbidden formations in 0-1 matrices

Published 13 May 2018 in math.CO and cs.DM | (1805.05328v1)

Abstract: Keszegh (2009) proved that the extremal function ex(n,P)ex(n, P) of any forbidden light $2$-dimensional 0-1 matrix PP is at most quasilinear in nn, using a reduction to generalized Davenport-Schinzel sequences. We extend this result to multidimensional matrices by proving that any light dd-dimensional 0-1 matrix PP has extremal function ex(n,P,d)=O(n<sup>d12<sup>α(n)<sup>t)ex(n, P,d) = O(n<sup>{d-1}2<sup>{\alpha(n)<sup>{t}}) for some constant tt that depends on PP. To prove this result, we introduce a new family of patterns called (P,s)(P, s)-formations, which are a generalization of (r,s)(r, s)-formations, and we prove upper bounds on their extremal functions. In many cases, including permutation matrices PP with at least two ones, we are able to show that our (P,s)(P, s)-formation upper bounds are tight.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.