Absolute Minima of Potentials of a Certain Class of Spherical Designs
Abstract
We use linear programming techniques to find points of absolute minimum over the unit sphere Sd in Rd+1 of the total potential of a point configuration ωN⊂ Sd which is a spherical (2m-1)-design contained in the union of some m parallel hyperplanes. The interaction between points is described by the kernel K( x, y)=f(| x- y|2), where |\ \!·\ \!| is the Euclidean norm in Rd+1. The potential function f is assumed to have a convex derivative f(2m-2). Points of minimum do not depend on f and are those and only those which form exactly m distinct dot products with points of ωN. The proof of this theorem was presented at a workshop at ESI in January 2022. Using this result, we find sets of universal minima of certain six configurations on higher-dimensional spheres.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.