The lonely vertex problem

MaRDI QIDQ1005902zbMATH OpenFDO

Authors Dirk Frettlöh, Alexey Glazyrin

Publication date 16 March 2009

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

Full work available at URL https://arxiv.org/abs/0710.4870, https://eudml.org/doc/222727, http://www.emis.de/journals/BAG/vol.50/no.1/5.html

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

zbMATH Keywords

convex polytopeslonely vertexsubstitution tilingstilings

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)

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.

Review text

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.

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

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)