Combinatorially Regular Polyomino Tilings
β Scribed by James W. Cannon; William J. Floyd; Walter R. Parry
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 260 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a given polyomino not to tile the plane (rotations and translations allowed). We apply the criterion to several families of polyominoes and show that the criterion detects some cases that are not detecta
## Dedicated to Professor GΓΌnter Asser on the occasion of his eightieth birthday We study the problem of tiling a polyomino P with as few squares as possible such that every square in the tiling has a non-empty intersection with the boundary of P . Our main result is an algorithm which given a sim
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