A reduction of lattice tiling by translates of a cubical cluster (Q1084677)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3979924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reduction of lattice tiling by translates of a cubical cluster |
scientific article; zbMATH DE number 3979924 |
Statements
A reduction of lattice tiling by translates of a cubical cluster (English)
0 references
1987
0 references
A finite union of unit cubes from the standard partition of n-space is called a cluster. A tiling by translates of a cluster is a covering of n- space without interior overlaps. Such a tiling is a lattice tiling if the translation vectors form a lattice. The paper consists of the proof that in dimension at most three any lattice tiling by translates of a cluster, the interior of which is connected, uses translation vectors with integer coordinates only. This property remains an open problem for dimensions higher than three. A counterexample is given to the case of disconnected clusters.
0 references
lattice tiling by translates
0 references
cluster
0 references
0 references
0.87796295
0 references
0.87129563
0 references
0.8654864
0 references
0.86426014
0 references
0 references
0.8526937
0 references
0.85249484
0 references
0 references
0 references
