1992
DOI: 10.1088/0305-4470/25/9/020
|View full text |Cite
|
Sign up to set email alerts
|

Energies and spacings of point charges on a sphere

Abstract: Numerical methods are in general required foc. the determination of the stable configurations of N point charges on a sphere. The stable configurations for N up to 50 have previously been ascertained and we extend the calculations here for values up to 101. We repon far the first time some remarkable global features of these configurations. We show that the minimum energy accurately follows a simple half-integral power law in 1 / N over the full range we have investigated. This power law is explicable in terms… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
56
0

Year Published

1997
1997
2017
2017

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 69 publications
(58 citation statements)
references
References 12 publications
2
56
0
Order By: Relevance
“…′ is the dimension of M. It is expected that the same kind of results hold [243,244,116,197,40,33,41], although it has not been proved yet, except in the case of the sphere in dimension d = 2 with V (x) = − log |x| [44].…”
Section: 7mentioning
confidence: 93%
“…′ is the dimension of M. It is expected that the same kind of results hold [243,244,116,197,40,33,41], although it has not been proved yet, except in the case of the sphere in dimension d = 2 with V (x) = − log |x| [44].…”
Section: 7mentioning
confidence: 93%
“…, y N } of nanotraps that minimizes H, and consequently maximizes C 0 , will be (roughly) uniformly distributed over the surface of the target sphere. This discrete optimization problem for points on the sphere is a generalization of the classical Fekete point problems of [20,5,39,27,44,7]. In addition, as a result of the different Green's functions involved, this problem is different from the discrete optimization problem derived in [12] to minimize the average MFPT for the narrow escape problem.…”
Section: R→∞ ∂ωRmentioning
confidence: 99%
“…In [1] the author obtains that the vertices of the regular icosahedron solve the Whyte's problem (α = 0), and claims that the methods he uses can be applied to solve the Thompson problem for N = 12. For other values of N , the problem has been constantly attacked with numerical methods (see [5], [9], [15], [16], [17]), with better configurations appearing in the literature occasionally.…”
mentioning
confidence: 99%