Complexity of convex stereohedra (Q1274100)

The author proves that any \(d\)-dimensional stereohedron, i.e., a spacefiller which admits an isohedral face-to-face tiling (that is, a tiling for which its symmetry group acts transitively on the tiles), has at most \( f(d) = 2^d ( H(d) - {1\over 2}) - 2 \) \((d-1)\)-dimensional faces where \( H(d) \) is the maximal index of the translation subgroup in an arbitrary crystallographic group (of dimension \(d\)). This improves the known bound by Delaunay (=Delone) (1961) by \( 3 \cdot 2^{d-1} \).