Title

Klarner Systems And Tiling Boxes With Polyominoes

Keywords

Polyomino; Prime rectangle; Rectangle; Tiling

Abstract

Let T be a protoset of d-dimensional polyominoes. Which boxes (rectangular parallelepipeds) can be tiled by T? 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. © 2004 Elsevier Inc. All rights reserved.

Publication Date

7-1-2005

Publication Title

Journal of Combinatorial Theory. Series A

Volume

111

Issue

1

Number of Pages

89-105

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.jcta.2004.10.010

Socpus ID

20344380417 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/20344380417

This document is currently not available here.

Share

COinS