Rigidity and the chessboard theorem for cube packings
From MaRDI portal
Publication:427797
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5009173 (Why is no real title available?)
- scientific article; zbMATH DE number 1229928 (Why is no real title available?)
- scientific article; zbMATH DE number 2159069 (Why is no real title available?)
- scientific article; zbMATH DE number 752601 (Why is no real title available?)
- A combinatorial approach for Keller's conjecture
- A cube tiling of dimension eight with no facesharing
- A non-analytic proof of the Newman-Znám result for disjoint covering systems
- Combinatorial cube packings in the cube and the torus
- Cube packings, second moment and holes
- Cube tiling and covering a complete graph
- Cube tilings as contributions of algebra to geometry
- Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
- Fourteen Proofs of a Result About Tiling a Rectangle
- How Berger, Felzenbaum and Fraenkel revolutionized Covering Systems the same way that George Boole revolutionized Logic
- Keller's conjecture on the existence of columns in cube tilings of \(\mathbb R^n\)
- Keller’s cube-tiling conjecture is false in high dimensions
- Lattice tilings by cubes: Whole, notched and extended
- On the structure of cube tilings and unextendible systems of cubes in low dimensions
- Orthonormal bases of exponentials for the n-cube
- Packing, Tiling, Orthogonality and Completeness
- Polyboxes, cube tilings and rigidity
Cited in
(4)
This page was built for publication: Rigidity and the chessboard theorem for cube packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427797)
