Translational tilings by a polytope, with multiplicity (Q2448959): Difference between revisions

A convex \(d\)-polytope \(P\) is said to \(k\)-tile \(\mathbb{R}^d\) by translation if there exists a covering, or \(k\)-tiling, of \(\mathbb{R}^d\) by translates of \(P\) such that each point of \(\mathbb{R}^d\) which is not on the boundary of any translate is covered exactly \(k\) times. The authors prove that if a convex polytope \(P\) \(k\)-tiles by translation for some \(k\geq 1\), then \(P\) must be centrally symmetric and have centrally symmetric facets. For rational polytopes the converse is true: every rational centrally symmetric convex polytope with centrally symmetric facets must necessarily \(k\)-tile by translation (even by a lattice) for some \(k\geq 1\).