Report Number: CS-TR-73-338
Institution: Stanford University, Department of Computer Science
Title: A finite basis theorem revisited.
Author: Klarner, David A.
Date: February 1973
Abstract: Let S denote a set of k-dimensional boxes each having
integral sides. Let $\Gamma$(S) denote the set of all boxes
which can be filled completely with translates of elements of
S. It is shown here that S contains a finite subset B such
that $\Gamma$(B) = $\Gamma$(S). This result was proved for k
= 1,2 in an earlier paper, but the proof for k > 2 contained