Tiling a Rectangle with the Fewest Squares
β Scribed by Richard Kenyon
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 594 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
We show how to determine if a given rectilinear polygon can be tiled with rectangles, each having an integer side.
The problem of finding polyominoes that tile rectangles has attracted a lot of attention; see [1] for an overview, and [2, 3] for more recent results. Several general families of such polyominoes are known, but sporadic examples seem to be scarce. Marshall [2, Fig. 9] gives a polyomino of rectangula
London publishing tycoon Rosco Redmond closely guards his family, his business, and his privacy. When his sisterβs wedding brings the paparazzi baying at his door, wedding photographer Kitty Mayfair unwittingly becomes his decoy girlfriend. But the mysterious Kitty has secrets of her own. Despite