Rigidity and the chess board theorem for cube packings
Andrzej P. Kisielewicz, Krzysztof Przesławski
Abstract
Each packing of Rd 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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.