A reciprocity theorem for domino tilings (Q5934767): Difference between revisions

Establishes various recurrence relations satisfied by the number \(T(m,n)\) of ways of tiling an \(m\times n\) rectangle. Some of the relations involve \(n\) being negative and it is shown that combinatorial interpetations can be given to these cases also in terms of signed matchings of grid graphs. Recurrence relations are obtained by the process of adjunction of two grid graphs, the definition of which process is given. 10 references to earlier work.