The Lonely Vertex Problem

Abstract

In a locally finite tiling of n-dim Euclidean space by convex polytopes, each point of the space is either a vertex of at least two tiles, or no vertex at all.

8 pages, 2 figures

References in corpus (2)

• Lectures on 0/1-polytopes
• Duality of Model Sets Generated by Substitutions

Cited by in corpus (1)

• Algebraic vertices of non-convex polyhedra