A242088 Number of edges in the convex hull of a rigorous solution to Thomson's problem for n points.

0, 0, 1, 3, 6, 9, 12

Offset

0,4

Comments

Thomson’s problem is to determine the stable equilibrium configuration(s) of n particles confined to the surface of a sphere and repelling each other by an inverse square force.

Rigorous solutions are known only for n <= 6 and n = 12, with a(12) = 30.

Non-rigorous solutions are given in Wikipedia for all n <= 460. The least non-monotonic pair is 63 > 60 for n = 23 and 24, respectively.

Links

Table of n, a(n) for n=0..6.

Kevin Brown, Min-Energy Configurations of Electrons On A Sphere

Eric Weisstein's MathWorld, Thomson Problem

Wikipedia, Thomson problem

Formula

a(n) <= n(n-1)/2 = (n choose 2).

a(n) <= 3*n-6 = A008585(n-2) for n >= 3, since a solution to Thomson's problem gives a planar graph, which has 3*n-6 edges if it is maximal (see A008486 comments). - Jonathan Sondow, Mar 03 2018 answering a question by Joseph Wheat.

Example

For n = 0 or 1 points, the convex hull is empty or a point, so there are no edges and a(0) = a(1) = 0.

Crossrefs

Cf. A008486, A008585, A080865, A242617, A268487.

Sequence in context: A353889 A113944 A198514 * A103695 A122809 A066662

Adjacent sequences: A242085 A242086 A242087 * A242089 A242090 A242091

Keyword

more,hard,nonn

Author

Jonathan Sondow, May 04 2014

Status

approved