English

Polarization problem on a higher-dimensional sphere for a simplex

Metric Geometry 2020-03-05 v1 Mathematical Physics math.MP Symplectic Geometry

Abstract

We study the problem of maximizing the minimal value over the sphere Sd1RdS^{d-1}\subset \mathbb R^d of the potential generated by a configuration of d+1d+1 points on Sd1S^{d-1} (the maximal discrete polarization problem). The points interact via the potential given by a function ff of the Euclidean distance squared, where f:[0,4](,]f:[0,4]\to (-\infty,\infty] is continuous (in the extended sense) and decreasing on [0,4][0,4] and finite and convex on (0,4](0,4] with a concave or convex derivative ff'. We prove that the configuration of the vertices of a regular dd-simplex inscribed in Sd1S^{d-1} is optimal. This result is new for d>3d>3 (certain special cases for d=2d=2 and d=3d=3 are also new). As a byproduct, we find a simpler proof for the known optimal covering property of the vertices of a regular dd-simplex inscribed in Sd1S^{d-1}.

Keywords

Cite

@article{arxiv.2003.02165,
  title  = {Polarization problem on a higher-dimensional sphere for a simplex},
  author = {Sergiy Borodachov},
  journal= {arXiv preprint arXiv:2003.02165},
  year   = {2020}
}

Comments

20 pages, no figures, 21 references

R2 v1 2026-06-23T14:03:55.207Z