2015
DOI: 10.1007/s10955-015-1245-6
|View full text |Cite
|
Sign up to set email alerts
|

Estimating the Number of Stable Configurations for the Generalized Thomson Problem

Abstract: Given a natural number N , one may ask what configuration of N points on the two-sphere minimizes the discrete generalized Coulomb energy. If one applies a gradientbased numerical optimization to this problem, one encounters many configurations that are stable but not globally minimal. This led the authors of this manuscript to the question, how many stable configurations are there? In this manuscript we report methods for identifying and counting observed stable configurations, and estimating the actual numbe… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
10
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 23 publications
0
10
1
Order By: Relevance
“…1. In all cases [68], we have obtained more minima than previous results given in the literature [27,69]. It is known that the number of local minima for a molecular system usually increases exponentially with system size [27,70,71].…”
mentioning
confidence: 62%
See 1 more Smart Citation
“…1. In all cases [68], we have obtained more minima than previous results given in the literature [27,69]. It is known that the number of local minima for a molecular system usually increases exponentially with system size [27,70,71].…”
mentioning
confidence: 62%
“…As in previous results for Lennard-Jones clusters [75][76][77], our networks are undirected and unweighted graphs and, hence, agnostic about all other information, such as barrier heights or transition rates between the minima. "EH" refers to the estimate of the number of minima given in [27], "CGS1" is a recent [69] fit to the number of minima found in previous calculations, and "CGS2" is an estimate [69] for the number of minima (we use the maximum out of those suggested in [69]). The lines connecting data points are a guide to the eye.…”
mentioning
confidence: 99%
“…Despite the apparent simplicity, both problems provide a serious computational challenge, of increasing difficulty with N : in particular, the number of local minima of the total electrostatic energy grows very fast with N (for the case of the Thomson problem see for example the discussion in Ref. [10]). As a result, the identification of the global minimum of a system of N charges typically requires extensive numerical calculations: in the absence of a formal criterium to establish whether a given configuration of equilibrium is a global minimum, one has to repeat the numerical calculations several times, keeping N fixed, and regard the configuration with lowest energy among those obtained as a probable candidate for a global minimum.…”
mentioning
confidence: 99%
“…For S 2 these expressions can be used to directly evaluate the Weyl sums (16), and hence their sum of squares, and their derivatives.…”
Section: Evaluating Criteriamentioning
confidence: 99%