Avoiding patterns in matrices via a small number of changes

Let $\mathcal{A}=\{A_1,\dots ,A_r\}$ be a partition of a set $\{1,\dots ,m\}\times \{1,\dots ,n\}$ into $r$ nonempty subsets, and $A=(a_{ij})$ be an $m\times n$ matrix. We say that $A$ has a pattern $\mathcal{A}$ provided that $a_{ij}=a_{i^{\mathrm{\prime }}{j}^{\mathrm{\prime }}}$ if and only if $(i,j),(i^{\mathrm{\prime }},j^{\mathrm{\prime }})\in A_t$ for some $t\in \{1,\dots ,r\}$. In this note we study the following function $f$ defined on the set of all $m\times n$ matrices $M$ with $s$ distinct entries: $f(M; {\cal A})$isthesmallestnumberofpositionswheretheentriesof$M$ need to be changed such that the resulting matrix does not have any submatrix with pattern $\mathcal{A}$. We give an asymptotically tight value for $$f(m,n;s,\mathcal{A})=\max \{f(M;\mathcal{A}):Misanm\times nmatrixwithatmostsdistinctentries\}\mathrm{.}$$