A reduction of lattice tiling by translates of a cubical cluster (Q1084677): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3671749 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tiling, packing, and covering by clusters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On mosaics consisting of multidimensional crosses / rank | |||
Normal rank | |||
Revision as of 16:41, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reduction of lattice tiling by translates of a cubical cluster |
scientific article |
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
