2 citations · 2 across the 3 of their papers we have counts for
Showing 2001Show all
2 papers · 1 filter
math.CO2001
Generalized domino-shuffling
James Propp
The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond grap…
math.CO2001
A reciprocity theorem for domino tilings
James Propp
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…