On the structure of cube tiling codes
From MaRDI portal
Publication:2198994
Abstract: Let be a set of arbitrary objects, and let . A polybox code is a set with the property that for every two words there is with , where a permutation of is such that and . If , then is called a cube tiling code. Cube tiling codes determine -periodic cube tilings of or, equivalently, tilings of the flat torus by translates of the unit cube as well as -perfect codes in in the maximum metric. By a structural result, cube tiling codes for are enumerated. It is computed that there are 27,385 non-isomorphic cube tiling codes in dimension four, and the total number of such codes is equal to 17,794,836,080,455,680. Moreover, some procedure of passing from a cube tiling code to a cube tiling code in dimensions is given.
Recommendations
Cites work
- A combinatorial approach for Keller's conjecture
- A complete resolution of the Keller maximum clique problem
- A cube tiling of dimension eight with no facesharing
- Combinatorial cube packings in the cube and the torus
- Cube packings, second moment and holes
- Cube tilings as contributions of algebra to geometry
- Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
- Enumerating cube tilings
- scientific article; zbMATH DE number 752601 (Why is no real title available?)
- Keller's conjecture on the existence of columns in cube tilings of R^n
- Keller’s cube-tiling conjecture is false in high dimensions
- Minimal partitions of a box into boxes
- On Keller's conjecture in dimension seven
- On the structure of cube tilings and unextendible systems of cubes in low dimensions
- On the structure of cube tilings of R^3 and R^4
- Partitions and balanced matchings of an n-dimensional cube
- Perfect codes in the \(\ell_p\) metric
- Polyboxes, cube tilings and rigidity
- Random sequential packing of cubes
- Rigid polyboxes and Keller's conjecture
- Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel
Cited in
(7)- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
- Gluing and cutting cube tiling codes in dimension six
- Enumerating cube tilings
- Projective tilings and full-rank perfect codes
- Irreducible subcube partitions
- A note on a flip-connected class of generalized domino tilings of the box \([0,2]^n\)
- Cube tilings with linear constraints
This page was built for publication: On the structure of cube tiling codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198994)