The Lonely Vertex Problem

Simple item page
dc.creatorFrettlöh, D.
dc.creatorGlazyrin, A.
dc.date2007-10-25
dc.date.accessioned2026-07-07T08:38:37Z
dc.date.available2026-07-07T08:38:37Z
dc.descriptionIn 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.
dc.description8 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0710.4870
dc.identifierhttp://arxiv.org/abs/0710.4870
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140791
dc.subjectMetric Geometry
dc.subject52C22
dc.titleThe Lonely Vertex Problem
dc.typetext

Files

Collections

arXiv