I read about the Thomson Problem in a Wiki Article (https://en.wikipedia.org/wiki/Thomson_problem)
The objective of the Thomson problem is to determine the minimum electrostatic potential energy configuration of N electrons constrained to the surface of a unit sphere that repel each other with a force given by Coulomb's law. The physicist J. J. Thomson posed the problem in 1904[1] after proposing an atomic model, later called the plum pudding model, based on his knowledge of the existence of negatively charged electrons within neutrally-charged atoms.
Minimum energy configurations have been rigorously identified in only a handful of cases.
I was very surprised when I read this because the solutions for the lower cases are very easy. What makes it difficult for scientists to generalize it to $N$ cases? Why is a computer not able to solve this for general $N$?
Is the Wikipedia Article dubious, especially since it lists solved cases for up to $N=400$ (which are not at all "handful")
Then the article also lists this strange looking conjecture,
According to a conjecture, if $m = n+2$, $p$ is the polyhedron formed by the convex hull of $m$ points, $q$ is the number of quadrilateral faces of $p$, then the solution for $m$ electrons is $f(m) = 0^n +3n -q$
Please, is the Thomson problem really tough?
If yes, Why?!
If no, How has it been solved for arbitrary value of $N$?
Consider a 2d-analogue of this problem. It should be "easier", right? We pack circles into a circle, all of the same diameter, which we try to maximize. This has been studied, and is itself a very hard problem. Even for 14 circles, it is unknown what the largest possible diameter is. Not so easy at all.