Saturation of 0-1 Matrices

Abstract: A 0-1 matrix $M$ contains a 0-1 matrix $P$ if $M$ has a submatrix $P'$ which can be turned into $P$ by changing some of the ones to zeroes. Matrix $M$ is $P$-saturated if $M$ does not contain $P$, but any matrix $M'$ derived from $M$ by changing a zero to a one must contain $P$. The saturation function $sat(n,P)$ is defined as the minimum number of ones of an $n \times n$ $P$-saturated 0-1 matrix. Fulek and Keszegh showed that each pattern $P$ has $sat(n,P) = O(1)$ or $sat(n,P) = \Theta(n)$. This leads to the natural problem of classifying forbidden 0-1 matrices according to whether they have linear or bounded saturation functions. Some progress has been made on this problem: multiple infinite families of matrices with bounded saturation function and other families with linear saturation function have been identified. We answer this question for all patterns with at most four ones, as well as several specific patterns with more ones, including multiple new infinite families. We also consider the effects of certain matrix operations, including the Kronecker product and insertion of empty rows and columns. Additionally, we consider the simpler case of fixing one dimension, extending results of (Fulek and Keszegh, 2021) and (Berendsohn, 2021). We also generalize some results to $d$-dimensional saturation.