A cube tiling of dimension eight with no facesharing (Q1864193): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q55919311, #quickstatements; #temporary_batch_1712111774907
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-002-2801-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023582594 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q55919311 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 03:45, 3 April 2024

scientific article
Language Label Description Also known as
English
A cube tiling of dimension eight with no facesharing
scientific article

    Statements

    A cube tiling of dimension eight with no facesharing (English)
    0 references
    0 references
    17 March 2003
    0 references
    \textit{O.-H. Keller} [J. Reine Angew. Math. 163, 231-248 (1930; JFM 56.1120.01)] conjectured that any tiling of \(n\)-dimensional space by translates of the unit \(n\)-cube contains a pair of cubes that share a complete common \((n-1)\)-dimensional face. \textit{O. Perron} [Math. Z. 46, 1-26 (1940; Zbl 0022.20205), ibid. 161-180 (1940; Zbl 0022.30802)] proved Keller's conjecture correct in dimensions \(\leq 6\). Corrádi and Szabo introduced the graph \(G_n\) with \(4^n\) vertices: the \(n\)-tuples \({\mathbf X}=(x_1, x_2, \dots,x_n)\) whose entries are \(0,1,2\) or 3; two verices \({\mathbf X}\) and \({\mathbf Y}\) are joined by an edge when \(|x_i-y_i |=2\) for at least one \(i\). They showed that Keller's conjecture is true in dimension \(n\) if and only if there is no clique of size \(2^n\) in \(G_n\) in which every pair of vertices differ in at least two coordinates. The author proves that Keller's conjecture is false for \(n=8\). He finds a clique in \(G_8\) with 256 vertices; indeed he lists them!
    0 references
    Keller's conjecture
    0 references

    Identifiers