Let t(k, n) denote the number of ways to tile a C x n rectangle with 1 x 2 rectangles (called dominoes). We show that for each fixed k the s( quence tk = (t(k, O), t(k, I), . . .) satisfies a difference equation (linear, homogeneous, and w ith constant coefficients). Furthermore, a computational met
β¦ LIBER β¦
On dimer coverings of rectangles of fixed width
β Scribed by Richard P. Stanley
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 297 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Domino tilings of rectangles with fixed
β
David Klarner; Jordan Pollack
π
Article
π
1980
π
Elsevier Science
π
English
β 761 KB
On point covers of parallel rectangles
β
GY. K Γ‘rolyi
π
Article
π
1991
π
Springer Netherlands
π
English
β 142 KB
Number of rectangles of unit width suffi
β
V. Yu. Bakenrot; O. B. Makarevich; A. G. Chefranov
π
Article
π
1984
π
Springer US
π
English
β 342 KB
Covering of polygons by rectangles
β
F. Cheng; I.-M. Lin
π
Article
π
1989
π
Elsevier Science
π
English
β 424 KB
Decomposing complex patterns into standardized geometric areas is essential for many pattern recognition and CAD applications 7"2. The decomposition of polygons into rectangles is studied in the paper. An algorithm that covers convex polygons by rectangles is presented. The algorithm works in two st
Universal coverings and projections of b
β
V. V. Makeev
π
Article
π
1992
π
Springer US
π
English
β 238 KB
On point covers of multiple intervals an
β
Gyula KΓ‘rolyi; GΓ‘bor Tardos
π
Article
π
1996
π
Springer-Verlag
π
English
β 525 KB