Tammes problem

In geometry, the Tammes problem is a problem in packing a given number of points on the surface of a sphere such that the minimum distance between points is maximized. It is named after the Dutch botanist Pieter Merkus Lambertus Tammes (the nephew of pioneering botanist Jantina Tammes) who posed the problem in his 1930 doctoral dissertation on the distribution of pores on pollen grains.^[1]

Unsolved problem in mathematics

What is the optimal packing of circles on the surface of a sphere for every possible amount of circles?

More unsolved problems in mathematics

12 points in an optimal arrangement around a sphere, which also are the points of a regular icosahedron.

It can be viewed as a particular special case of the generalized Thomson problem of minimizing the total Coulomb force of electrons in a spherical arrangement.^[2] Thus far, solutions have been proven only for small numbers of circles: 3 through 14, and 24.^[3] There are conjectured solutions for many other cases, including those in higher dimensions.^[4]

Some natural systems such as this coral require approximate solutions to problems similar to the Tammes problem

See also

• Spherical code
• Kissing number problem
• Cylinder sphere packings