Enumerating cube tilings
From MaRDI portal
Publication:393746
DOI10.1007/S00454-013-9547-4zbMATH Open1283.52027OpenAlexW2077491088MaRDI QIDQ393746FDOQ393746
Authors: K. Ashik Mathew, Patric R. J. Östergård, Alexandru Popa 
Publication date: 24 January 2014
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9547-4
Recommendations
Cites Work
- Classification algorithms for codes and designs
- Isomorph-Free Exhaustive Generation
- Keller’s cube-tiling conjecture is false in high dimensions
- Cube tilings as contributions of algebra to geometry
- A cube tiling of dimension eight with no facesharing
- Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel
- Random sequential packing of cubes
- A complete resolution of the Keller maximum clique problem
- Switching codes and designs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- Cube packings, second moment and holes
Cited In (8)
- Lattice tilings by cubes: Whole, notched and extended
- Cube tilings with linear constraints
- Title not available (Why is that?)
- Gluing and cutting cube tiling codes in dimension six
- On hypercube packings, blocking sets and a covering problem
- New results on torus cube packings and tilings
- On the structure of cube tiling codes
- A note on a flip-connected class of generalized domino tilings of the box \([0,2]^n\)
Uses Software
This page was built for publication: Enumerating cube tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393746)
