Extremal dispositions of the points on the sphere (Q1375048): Difference between revisions

In this paper the following problem is investigated: Dispose \(N\) points on the unit sphere \(S^{n-1}\) (in \(\mathbb R^n\)) in such a way that the sum of the distances between all pairs of points attain its maximum. Some questions are solved with properties of interpolation polynomials. Relevant to this the paper gives several interesting theorems. At the end of the paper a short information is given about the problem to dispose \(N\) points on the sphere so that the product of distances between all pairs of points is the greatest. The results were obtained in 1994.