Newton–Gregory kissing number problem in unresolved dimensions
Determine the maximum number of non-overlapping unit spheres that can simultaneously touch a given unit sphere in each Euclidean dimension, thereby resolving the Newton–Gregory kissing number problem in all dimensions.
References
The case $\theta=\pi/3$ is known as the famous (Newton-Gregory) kissing number problem. With extensive efforts from many mathematicians, it is still not completely resolved in every dimension (but resolved in dimensions $d=1$ ($n=2$), $d=2$ ($n=6$), $d=3$ ($n=12$), $d=4$ ($n=24$), $d=8$ ($n=240$), $d=24$ ($n=196560$)) .
In dimensions $d\leq 8$, the best known lower bounds are attained by configurations already known in the nineteenth century or earlier; the classical root systems provide examples of all these sizes. Their persistence does not mean that the corresponding optimality questions have all been settled: the exact kissing numbers in dimensions $5$, $6$, and $7$ remain unknown.