Loading AI tools
Hilbert's eighteenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by mathematician David Hilbert. It asks three separate questions about lattices and sphere packing in Euclidean space.[1]
The first part of the problem asks whether there are only finitely many essentially different space groups in -dimensional Euclidean space. This was answered affirmatively by Bieberbach.
The second part of the problem asks whether there exists a polyhedron which tiles 3-dimensional Euclidean space but is not the fundamental region of any space group; that is, which tiles but does not admit an isohedral (tile-transitive) tiling. Such tiles are now known as anisohedral. In asking the problem in three dimensions, Hilbert was probably assuming that no such tile exists in two dimensions; this assumption later turned out to be incorrect.
The first such tile in three dimensions was found by Karl Reinhardt in 1928. The first example in two dimensions was found by Heesch in 1935.[2] The related einstein problem asks for a shape that can tile space but not with an infinite cyclic group of symmetries.
The third part of the problem asks for the densest sphere packing or packing of other specified shapes. Although it expressly includes shapes other than spheres, it is generally taken as equivalent to the Kepler conjecture.
In 1998, American mathematician Thomas Callister Hales gave a computer-aided proof of the Kepler conjecture. It shows that the most space-efficient way to pack spheres is in a pyramid shape.[3]
Wikiwand in your browser!
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
