The Lonely Vertex Problem
classification
🧮 math.MG
keywords
vertexspaceconvexeithereuclideanfiniteleastlocally
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.