Keller's conjecture on face-sharing pairs in cube tilings
Let be an integer. A unit cube in is a translate of , and a cube tiling is a family of pairwise disjoint unit cubes whose union is . A tiling is faceshare-free if no two distinct cubes share a complete -dimensional face.
Keller's conjecture. For all integers , there does not exist a faceshare-free tiling of .
Equivalently, every tiling of -dimensional space by translates of the unit cube contains a pair of cubes that share a complete -dimensional face. The conjecture is false in dimension , while the paper establishes that it is true in dimension ; hence the conjecture is resolved.
References
Primary source
Joshua Brakensiek, Marijn Heule, John Mackey and David Narváez, “The Resolution of Keller's Conjecture”, arXiv:1910.03740 (2023).
Progress summary
The conjecture is resolved: computer-certified work proves it in seven or fewer dimensions, while explicit constructions disprove it in eight or more.
Keller posed the conjecture in 1930, asking whether every tiling by equal cubes contains two cubes sharing a whole face. The final unresolved case was dimension seven.
Known results
- Perron, 1940: proved the conjecture for dimensions .
- Lagarias and Shor, 1992: constructed counterexamples in dimensions .
- Mackey, 2002: constructed a counterexample in dimension , implying one in dimension .
- Kisielewicz and Łysakowska, 2017: reduced the remaining seven-dimensional analysis to the case .
2019–2020 final resolution
Brakensiek, Heule, Mackey, and Narváez ruled out the required clique of size in the relevant Keller graphs. Their unsatisfiability certificates were checked by a formally verified checker, proving the seven-dimensional case; the same work verifies a faceshare-free tiling in dimension . Later literature records the resulting status without reporting a gap or objection.
Current status (as of August 2026): Keller's conjecture is settled, true for and false for .
Solutions 0
No solutions have been posted yet.