A Reciprocity Theorem for Domino Tilings
Keyword(s):
Let $T(m,n)$ denote the number of ways to tile an $m$-by-$n$ rectangle with dominos. For any fixed $m$, the numbers $T(m,n)$ satisfy a linear recurrence relation, and so may be extrapolated to negative values of $n$; these extrapolated values satisfy the relation $$T(m,-2-n)=\epsilon_{m,n}T(m,n),$$ where $\epsilon_{m,n}=-1$ if $m \equiv 2$ (mod 4) and $n$ is odd and where $\epsilon_{m,n}=+1$ otherwise. This is equivalent to a fact demonstrated by Stanley using algebraic methods. Here I give a proof that provides, among other things, a uniform combinatorial interpretation of $T(m,n)$ that applies regardless of the sign of $n$.
2003 ◽
Vol 373
◽
pp. 89-99
◽
2008 ◽
Vol 28
(5)
◽
pp. 1369-1375
◽
1978 ◽
Vol 364
(1717)
◽
pp. 265-275
◽
1997 ◽
Vol 42
(11)
◽
pp. 1554-1558
◽
2021 ◽
Vol 2113
(1)
◽
pp. 012070
2009 ◽
Vol 2009
◽
pp. 1-21
◽
1956 ◽
Vol 237
(1208)
◽
pp. 17-27
1981 ◽
Vol 22
(3)
◽
pp. 314-317
◽