Klarner systems and tiling boxes with polyominoes

Authors:
Michael Reid
Affiliations:
Department of Mathematics, University of Central Florida, Orlando, FL
Venue:
Journal of Combinatorial Theory Series A
Year:
2005

Citing 10
Cited 0

Polyominoes which tile rectangles

Journal of Combinatorial Theory Series A
The Y-hexomino has order 92

Journal of Combinatorial Theory Series A
A heptomino of order 76

Journal of Combinatorial Theory Series A
An octomino of high order

Journal of Combinatorial Theory Series A
Packing rectangles with congruent polyominoes

Journal of Combinatorial Theory Series A
Tiling rectangles and half strips with congruent polyominoes

Journal of Combinatorial Theory Series A
Tiling a square with eight congruent polyominoes

Journal of Combinatorial Theory Series A
Tiling with notched cubes

Discrete Mathematics
Selected combinatorial research problems.

Selected combinatorial research problems.
A finite basis theorem revisited.

A finite basis theorem revisited.

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let I be a protoset of d-dimensional polyominoes. Which boxes (rectangular parallelepipeds) can be tiled by I? A nice result of Klarner and Göbel asserts that the answer to this question can always be given in a particularly simple form, namely, by giving a finite list of "prime" boxes. All other boxes that can be tiled can be deduced from these prime boxes. We give a new, simpler proof of this fundamental result. We also show that there is no upper bound to the number of prime boxes, even when restricting attention to singleton protosets. In the last section, we determine the set of prime rectangles for several small polyominoes.