Enumerating tilings of rectangles by squares with recurrence relations (Q746833)

The following problem is under consideration. Given an \(m \times n\) rectangular board and square tiles of various fixed dimensions, in how many different ways can the board be tiled? The transfer matrix method by \textit{S. Heubach} [Congr. Numerantium 140, 43--64 (1999; Zbl 0960.05035)] is based on constructing recurrence relations for sequences formed when \(m\) is fixed and \(n\) varies. However, the complexity grows significantly as the fixed number of rows grows. In the paper under review, the author proposes a variation of the transfer matrix method that allows to generate recurrence relations for a wider class of problems. In particular, the method is applied to the three-dimensional analogue of this problem, tiling \(m \times n \times k\) rectangular prism with cubes of fixed dimensions. The author gives an explicit upper bound on the order of recurrence for a tiling problem with \(1 \times 1\) and \(2 \times 2\) squares for fixed number of rows. He also proves that there does not exist a graph whose matchings have a one-to-one correspondence with such tilings.