Forbidden formations in 0-1 matrices
Jesse Geneson

TL;DR
This paper extends bounds on the extremal function of forbidden 0-1 matrices from two dimensions to multiple dimensions, introducing new pattern families and proving tight bounds for many cases.
Contribution
It generalizes extremal function bounds to multidimensional matrices and introduces the $(P, s)$-formation pattern family with tight bounds in key cases.
Findings
Extremal function for multidimensional matrices is $O(n^{d-1}2^{eta(n)^{t}})$.
$(P, s)$-formations generalize previous pattern families.
Tight bounds are established for permutation matrices with at least two ones.
Abstract
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 -formations, which are a generalization of -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 -formation upper bounds are tight.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
