Problem (Combinatorics):
Given positive integers $m$ and $n \geq m$, determine the largest number of dominoes $(1 \times 2$ or $2 \times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2 n$ columns consisting of cells $(1 \times 1$ squares $)$ so that:



(i) each domino covers exactly two adjacent cells of the board;



(ii) no two dominoes overlap;



(iii) no two form a $2 \times 2$ square; and



(iv) the bottom row of the board is completely covered by $n$ dominoes.

Solution:
The required maximum is $m n-\lfloor m / 2\rfloor$ and is achieved by the brick-like vertically symmetric arrangement of blocks of $n$ and $n-1$ horizontal dominoes placed on alternate rows, so that the bottom row of the board is completely covered by $n$ dominoes.



To show that the number of dominoes in an arrangement satisfying the conditions in the statement does not exceed $m n-\lfloor m / 2\rfloor$, label the rows upwards $0,1, \ldots, m-1$, and, for each $i$ in this range, draw a vertically symmetric block of $n-i$ fictitious horizontal dominoes in the $i$-th row (so the block on the $i$-th row leaves out $i$ cells on either side) - Figure 4 illustrates the case $m=n=6$. A fictitious domino is good if it is completely covered by a domino in the arrangement; otherwise, it is bad.



If the fictitious dominoes are all good, then the dominoes in the arrangement that cover no fictitious domino, if any, all lie in two triangular regions of side-length $m-1$ at the upper-left and upper-right corners of the board. Colour the cells of the board chess-like and notice that in each of the two triangular regions the number of black cells and the number of white cells differ by $\lfloor m / 2\rfloor$. Since each domino covers two cells of different colours, at least $\lfloor m / 2\rfloor$ cells are not covered in each of these regions, and the conclusion follows.







Fig. 4





Fig. 5



To deal with the remaining case where bad fictitious dominoes are present, we show that an arrangement satisfying the conditions in the statement can be transformed into another such with at least as many dominoes, but fewer bad fictitious dominoes. A finite number of such transformations eventually leads to an arrangement of at least as many dominoes all of whose fictitious dominoes are good, and the conclusion follows by the preceding.



Consider the row of minimal rank containing bad fictitious dominoes - this is certainly not the bottom row - and let $D$ be one such. Let $\ell$, respectively $r$, be the left, respectively right, cell of $D$ and notice that the cell below $\ell$, respectively $r$, is the right, respectively left, cell of a domino $D_{1}$, respectively $D_{2}$, in the arrangement.



If $\ell$ is covered by a domino $D_{\ell}$ in the arrangement, since $D$ is bad and no two dominoes in the arrangement form a square, it follows that $D_{\ell}$ is vertical. If $r$ were also covered by a domino $D_{r}$ in the arrangement, then $D_{r}$ would also be vertical, and would therefore form a square with $D_{\ell}-$ a contradiction. Hence $r$ is not covered, and there is room for $D_{\ell}$ to be placed so as to cover $D$, to obtain a new arrangement satisfying the conditions in the statement; the latter has as many dominoes as the former, but fewer bad fictitious dominoes. The case where $r$ is covered is dealt with similarly.



Finally, if neither cell of $D$ is covered, addition of an extra domino to cover $D$ and, if necessary, removal of the domino above $D$ to avoid formation of a square, yields a new arrangement satisfying the conditions in the statement; the latter has at least as many dominoes as the former, but fewer bad fictitious dominoes. (Figure 5 illustrates the two cases.)

We present an alternative proof of the bound.



Label the rows upwards $0,1, \ldots, m-1$, and the columns from the left to the right by $0,1, \ldots, 2 n-1$; label each cell by the pair of its column's and row's numbers, so that $(1,0)$ is the second left cell in the bottom row. Colour the cells chess-like so that $(0,0)$ is white. For $0 \leq i \leq n-1$, we say that the $i$ th white diagonal is the set of cells of the form $(2 i+k, k)$, where $k$ ranges over all appropriate indices. Similarly, the ith black diagonal is the set of cells of the form $(2 i+1-k, k)$. (Notice that the white cells in the upper-left corner and the black cells in the upper-right corner are not covered by these diagonals.)



Claim. Assume that $K$ lowest cells of some white diagonal are all covered by dominoes. Then all these $K$ dominoes face right or up from the diagonal. (In other words, the black cell of any such







domino is to the right or to the top of its white cell.) Similarly, if $K$ lowest cells of some black diagonal are covered by dominoes, then all these dominoes face left or up from the diagonal.



Proof. By symmetry, it suffices to prove the first statement. Assume that $K$ lowest cells of the $i$ th white diagonal is completely covered. We prove by induction on $k<K$ that the required claim holds for the domino covering $(2 i+k, k)$. The base case $k=0$ holds due to the problem condition. To establish the step, one observes that if $(2 i+k, k)$ is covered by a domino facing up of right, while $(2 i+k+1, k+1)$ is covered by a domino facing down or left, then these two dominoes form a square.



We turn to the solution. We will prove that there are at least $d=\lfloor m / 2\rfloor$ empty white cells. Since each domino covers exactly one white cell, the required bound follows.



If each of the first $d$ white diagonals contains an empty cell, the result is clear. Otherwise, let $i<d$ be the least index of a completely covered white diagonal. We say that the dominoes covering our diagonal are distinguished. After removing the distinguished dominoes, the board splits into two parts; the left part $L$ contains $i$ empty white cells on the previous diagonals. So, it suffices to prove that the right part $R$ contains at least $d-i$ empty white cells.



Let $j$ be the number of distinguished dominoes facing up. Then at least $j-i$ of these dominoes cover some cells of (distinct) black diagonals (the relation $m \leq n$ is used). Each such domino faces down from the corresponding black diagonal - so, by the Claim, each such black diagonal contains an empty cell in $R$. Thus, $R$ contains at least $j-i$ empty black cells.



Now, let $w$ be the number of white cells in $R$. Then the number of black cells in $R$ is $w-d+j$, and at least $i-j$ of those are empty. Thus, the number of dominoes in $R$ is at most $(w-d+j)-(j-i)=w-(d-i)$, so $R$ contains at least $d-i$ empty white cells, as we wanted to show.

Final answer: $m n-\lfloor m / 2\rfloor$