A reciprocity theorem for domino tilings (Q5934767)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1597806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reciprocity theorem for domino tilings |
scientific article; zbMATH DE number 1597806 |
Statements
A reciprocity theorem for domino tilings (English)
0 references
15 May 2001
0 references
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.
0 references
domino tilings
0 references
generating function
0 references
recurrence relations
0 references
0.8125224709510803
0 references
0.7958148717880249
0 references
0.7947835922241211
0 references
0.7947834730148315
0 references
0.7862387299537659
0 references
