P 1 , P 2 , … , P n are points on the surface of the unit sphere. Define D n as the set of all possible distances between any two of these points.
Find
n = 2 ∑ 6 d ∈ D n , σ min d
where σ is some distribution of P 1 , P 2 , … , P n such that the mean distance between points is maximised.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This is essentially equivalent to symmetry considerations. And that's what I used.
Funny thing is, I misread Vesper as Vespa, as in the scooter, and was wondering what a scooter has to do with minimal distances on a sphere :D
However, I would recommend using less math and more English because I have grave doubts as to the percentage of people who will understand the 'wording'(without words :D) of this question. Anyways, nice question. :)
Log in to reply
Thanks for the tip! I actually spotted a mistake in the question as well while rewording the question; the constraint on σ was "wrong" since the sum should have been taken over all (not necessarily distinct) distances rather than the set D n , σ (which contains ≤ ( 2 n ) elements).
Log in to reply
Yes, I noticed that, but I thought that I wasn't understanding it right.
Problem Loading...
Note Loading...
Set Loading...
Let's consider VSEPR from chemistry. In this case, each point on the sphere is an electron domain.
VSEPR tells us two electron domains, minimising repulsion, will form a linear electron geometry. In the same way, three will form a trigonal planar geometry, four a tetrahedral geometry, five trigonal bipyramidal, and six octahedral.
There exists only one possible distance for n = 2 , 3 , 4 : 2 , 3 , 8 / 3 respectively. However, for n = 5 , there exists 3 different distances. The minimum of these is 2 , as is the minimum of the 2 different distances for n = 2 .
As such, the sum of minimum distances is then
2 + 3 + 8 / 3 + 2 + 2 ≈ 8 . 1 9 3
Thanks, chemistry. Harasho .