Translational tilings by a polytope, with multiplicity

From MaRDI portal
Publication:2448959



Abstract: We study the problem of covering R^d by overlapping translates of a convex body P, such that almost every point of R^d is covered exactly k times. Such a covering of Euclidean space by translations is called a k-tiling. The investigation of tilings (i.e. 1-tilings in this context) by translations began with the work of Fedorov and Minkowski. Here we extend the investigations of Minkowski to k-tilings by proving that if a convex body k-tiles R^d by translations, then it is centrally symmetric, and its facets are also centrally symmetric. These are the analogues of Minkowski's conditions for 1-tiling polytopes. Conversely, in the case that P is a rational polytope, we also prove that if P is centrally symmetric and has centrally symmetric facets, then P must k-tile R^d for some positive integer k.


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\).




Cited in
(29)








This page was built for publication: Translational tilings by a polytope, with multiplicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448959)