A reduction of lattice tiling by translates of a cubical cluster (Q1084677)

A finite union of unit cubes from the standard partition of n-space is called a cluster. A tiling by translates of a cluster is a covering of n- space without interior overlaps. Such a tiling is a lattice tiling if the translation vectors form a lattice. The paper consists of the proof that in dimension at most three any lattice tiling by translates of a cluster, the interior of which is connected, uses translation vectors with integer coordinates only. This property remains an open problem for dimensions higher than three. A counterexample is given to the case of disconnected clusters.