Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Vol. 50, No. 1, pp. 71-79 (2009) |
|
The lonely vertex problemD. Frettlöh and A. GlazyrinFakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany, e-mail: dirk.frettloeh@math.uni-bielefeld.de; Moscow State University, Leninskie Gory, 119992 Moscow GSP-2, Russia, e-mail: xoled@rambler.ruAbstract: In a locally finite tiling of $\R^n$ by convex polytopes, each point $x \in \R^n$ is either a vertex of at least two tiles, or no vertex at all. Keywords: tilings, convex polytopes Classification (MSC2000): 52C22, 52C07 Full text of the article:
Electronic version published on: 29 Dec 2008. This page was last modified: 28 Jan 2013.
© 2008 Heldermann Verlag
|