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 of the potential generated by a configuration of points on (the maximal discrete polarization problem). The points interact via the potential given by a function of the Euclidean distance squared, where is continuous (in the extended sense) and decreasing on and finite and convex on with a concave or convex derivative . We prove that the configuration of the vertices of a regular -simplex inscribed in is optimal. This result is new for (certain special cases for and are also new). As a byproduct, we find a simpler proof for the known optimal covering property of the vertices of a regular -simplex inscribed in .
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