The lonely vertex problem

zbMATH Open1167.52017arXiv0710.4870MaRDI QIDQ1005902FDOQ1005902

Authors: Dirk Frettlöh, Alexey Glazyrin 

Publication date: 16 March 2009

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0710.4870

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Singular points of a convex tiling
• Singular points of a star-finite tiling
• Tilings whose members have finitely many neighbors
• Some tilings of the plane whose singular points are uncountable and unbounded
• Tiling with smooth and rotund tiles

zbMATH Keywords

convex polytopestilingssubstitution tilingslonely vertex

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Quasicrystals and aperiodic tilings in discrete geometry (52C23)

Cited In (1)

• Algebraic vertices of non-convex polyhedra

This page was built for publication: The lonely vertex problem

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