Rigidity and the chessboard theorem for cube packings
From MaRDI portal
Publication:427797
DOI10.1016/j.ejc.2012.01.006zbMath1244.52013arXivmath/0610693OpenAlexW2076881848MaRDI QIDQ427797
Krzysztof Przeslawski, Andrzej P. Kisielewicz
Publication date: 18 June 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610693
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the structure of cube tilings and unextendible systems of cubes in low dimensions
- Cube packings, second moment and holes
- Polyboxes, cube tilings and rigidity
- Combinatorial cube packings in the cube and the torus
- A non-analytic proof of the Newman-Znám result for disjoint covering systems
- Cube tiling and covering a complete graph
- Cube tilings as contributions of algebra to geometry
- Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
- Lattice tilings by cubes: Whole, notched and extended
- Orthonormal bases of exponentials for the \(n\)-cube
- A cube tiling of dimension eight with no facesharing
- A combinatorial approach for Keller's conjecture
- Keller’s conjecture on the existence of columns in cube tilings of ℝn
- Fourteen Proofs of a Result About Tiling a Rectangle
- Keller’s cube-tiling conjecture is false in high dimensions
- Packing, Tiling, Orthogonality and Completeness
- How Berger, Felzenbaum and Fraenkel revolutionized Covering Systems the same way that George Boole revolutionized Logic
This page was built for publication: Rigidity and the chessboard theorem for cube packings
