All Questions
1 question with no upvoted or accepted answers
2
votes
0
answers
108
views
number of ways to cover an $m × n$ rectangle
Given a positive integer $k\ge2$, let be $f_k(m,n)$ the number of ways to cover an $m × n$ rectangle with $mn/k$ tiles ( $1×k$ or $k×1$)
$f_2(m,n)$ is kasteleyn formula
$f_k(m,n)$?
- 683