BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-73-338
       ENTRY:: September 25, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A finite basis theorem revisited.
        TYPE:: Technical Report
      AUTHOR:: Klarner, David A.
        DATE:: February 1973
       PAGES:: 10
    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
               an error.
       NOTES:: [Adminitrivia V1/Prg/19950925]
         END:: STAN//CS-TR-73-338