Kinetic Transition Networks for the Thomson Problem and Smale's Seventh Problem.

ABSTRACT

The Thomson problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here, we show that the energy landscape of the Thomson problem for N particles with N=132, 135, 138, 141, 144, 147, and 150 is single funneled, characteristic of a structure-seeking organization where the global minimum is easily accessible. Algorithmically, constructing starting points close to the global minimum of such a potential with spherical constraints is one of Smale's 18 unsolved problems in mathematics for the 21st century because it is important in the solution of univariate and bivariate random polynomial equations. By analyzing the kinetic transition networks, we show that a randomly chosen minimum is, in fact, always "close" to the global minimum in terms of the number of transition states that separate them, a characteristic of small world networks.