
doi: 10.1007/bf02789828
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.
extremal problems, Numerical interpolation, interpolation polynomials, Inequalities and extremum problems involving convexity in convex geometry, Distance geometry, Hyperbolic and elliptic geometries (general) and generalizations, distance problems, points on the sphere, Interpolation in approximation theory, extremal dispositions of points
extremal problems, Numerical interpolation, interpolation polynomials, Inequalities and extremum problems involving convexity in convex geometry, Distance geometry, Hyperbolic and elliptic geometries (general) and generalizations, distance problems, points on the sphere, Interpolation in approximation theory, extremal dispositions of points
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 17 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
