The lonely vertex problem (Q1005902)

Consider a locally finite tiling of \(\mathbb{R}^{n}\) by convex polytopes. The question reads: is there a point \(x\) which is a vertex of exactly one tiling? Such a point is called a lonely vertex. Here `vertex' means the vertex of a convex polytope in the usual geometric sense. The question is answered negative. Applications to aperiodic tilings (substitution tilings) are considered.