An intermediate case of exponential multivalued forbidden matrix configurations

The forbidden number Forb(m, F), which denotes the maximum number of distinct columns in an m-rowed (0, 1)-matrix with no submatrix that is a row and column permutation of F, has been widely studied in extremal set theory. Recently, this function was extended to r-matrices, whose entries lie in {0, 1, ⋯, r − 1}. Forb(m, r, F) is the maximum number of distinct columns in an r-matrix with no submatrix that is a row and column permutation of F. While Forb(m, F) is polynomial in m, Forb(m, r, F) is exponential for r ≥ 3. Recently, Forb(m, r, F) was studied for some small (0, 1)-matrices F, and exact values were determined in some cases. In this paper we study Forb(m, r, M) for M=\begin{bmatrix}0&1\0&1\1&0\end{bmatrix}, which is the smallest matrix for which this forbidden number is unknown. Interestingly, it turns out that this problem is closely linked with the following optimisation problem. For each triangle in the complete graph Km, pick one of its edges. Let me denote the number of times edge e is picked. For each α ∈ ℝ, what is H(m, α) = max ∑e ∈ E(Km)αme? We establish a relationship between Forb(m,r,M) and H(m, (r − 1)/(r − 2)), find upper and lower bounds for H(m, α), and use them to significantly improve known bounds for Forb(m, r, M).