Pattern Forcing (0,1)-Matrices

TL;DR

This paper introduces and analyzes two notions of pattern enforcement in (0,1)-matrices, establishing extremal constructions, formulas, and bounds that deepen understanding of pattern embedding in such matrices.

Contribution

It formalizes $Q$-forcing and strongly $Q$-forcing, providing extremal characterizations, explicit formulas, and bounds, and proposing conjectures for maximum entries in strongly $I_k$-forcing matrices.

Findings

Existence and uniqueness of extremal $Q$-forcing matrices

Bounds on the number of 1s and 0s in strongly $Q$-forcing matrices

Conjectural formulas for maximum entries in strongly $I_k$-forcing matrices

Abstract

We introduce two related notions of pattern enforcement in $(0,1)$-matrices: $Q$-forcing and strongly $Q$-forcing, which formalize distinct ways a fixed pattern $Q$ must appear within a larger matrix. A matrix is $Q$-forcing if every submatrix can realize $Q$ after turning any number of $1$-entries into $0$-entries, and strongly $Q$-forcing if every $1$-entry belongs to a copy of $Q$. For $Q$-forcing matrices, we establish the existence and uniqueness of extremal constructions minimizing the number of $1$-entries, characterize them using Young diagrams and corner functions, and derive explicit formulas and monotonicity results. For strongly $Q$-forcing matrices, we show that the minimum possible number of $0$-entries of an $m\times n$ strongly $Q$-forcing matrix is always $O(m+n)$, determine the maximum possible number of $1$-entries of an $n\times n$ strongly $P$-forcing matrix for every $2\times2$ and $3\times3$ permutation matrix, and identify symmetry classes with identical extremal behavior. We further propose a conjectural formula for the maximum possible number of $1$-entries of an $n\times n$ strongly $I_k$-forcing matrix, supported by results for $k=2,3$. These findings reveal contrasting extremal structures between forcing and strongly forcing, extending the combinatorial understanding of pattern embedding in $(0,1)$-matrices.