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 of any forbidden light $2$-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.
Paper Prompts
Sign up for free to create and run prompts on this paper.