The lonely vertex problem (Q1005902): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0710.4870 / rank | |||
Normal rank |
Latest revision as of 19:39, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The lonely vertex problem |
scientific article |
Statements
The lonely vertex problem (English)
0 references
16 March 2009
0 references
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.
0 references
tilings
0 references
convex polytopes
0 references
lonely vertex
0 references
substitution tilings
0 references