Rigidity and the chess board theorem for cube packings
classification
🧮 math.CO
math.MG
keywords
cubeunitadmitsbelongsboardchesscovereddecomposition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.