Rigidity and the chess board theorem for cube packings
Combinatorics
2009-02-12 v2 Metric Geometry
Abstract
Each 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.
Keywords
Cite
@article{arxiv.math/0610693,
title = {Rigidity and the chess board theorem for cube packings},
author = {Andrzej P. Kisielewicz and Krzysztof Przesławski},
journal= {arXiv preprint arXiv:math/0610693},
year = {2009}
}
Comments
7 pages, 3 figures, corrections made, expanded content