Hilbert's eighteenth problem

Hilbert's eighteenth problem is one of the 23 problems set out in a celebrated list compiled in 1900 by mathematician David Hilbert.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Hilbert's eighteenth problem is one of the 23 problems set out in a celebrated list compiled in 1900 by mathematician David Hilbert. It asks three separate questions on the space group in n -dimensional Euclidean space, anisohedral tiling in three-dimensional Euclidean space, and the densest sphere packing in Kepler conjecture. Respectively, these questions were answered affirmatively by Ludwig Bieberbach, Karl Reinhardt, and Thomas Callister Hales.

First question: symmetry groups in dimensions

The first question in Hilbert's problem asks whether there are only finitely many essentially different space groups in n -dimensional Euclidean space. Here, a space group or crystallographic group is the symmetry group of a repeating pattern in space, usually in three dimensions, with its symmetry operation as the rigid transformations of the pattern that leave it unchanged.

This question was answered affirmatively by Ludwig Bieberbach. Named as Bieberbach group, Bieberbach proved that the subgroup of translations of any such group contains n linearly independent translations, and is a free abelian subgroup of finite index, and is also the unique maximal normal abelian subgroup.

Bieberbach also showed that, in any dimension n , there are only a finite number of possibilities for the isomorphism class of the underlying group of a space group, and the action of the group on Euclidean space is moreover unique up to conjugation by affine transformations. \frac{\pi}{3\sqrt{2}} = 0.74048. 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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1364361992 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

8 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.