Tiling a Polygon with Two Kinds of Rectangles
✍ Scribed by Eric Rémila
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 215 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We show how to determine if a given rectilinear polygon can be tiled with rectangles, each having an integer side.
We show that a square-tiling of a p\_q rectangle, where p and q are relatively prime integers, has at least log 2 p squares. If q>p we construct a square-tiling with less than qÂp+C log p squares of integer size, for some universal constant C.
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