Rigidity and the chess board theorem for cube packings

Simple item page
dc.creatorKisielewicz, Andrzej P.
dc.creatorPrzesławski, Krzysztof
dc.date2006-10-23
dc.date2009-02-12
dc.date.accessioned2026-07-07T12:40:45Z
dc.date.available2026-07-07T12:40:45Z
dc.descriptionEach packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.
dc.description7 pages, 3 figures, corrections made, expanded content
dc.identifierhttps://arxiv.org/abs/math/0610693
dc.identifierhttp://arxiv.org/abs/math/0610693
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219540
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52C22; 05B45
dc.titleRigidity and the chess board theorem for cube packings
dc.typetext

Files

Collections

arXiv