Minimal dispersion on the sphere
Abstract
The minimal spherical cap dispersion dispC(n,d) is the largest number ∈ (0,1] such that, for every n points on the d-dimensional Euclidean unit sphere Sd, there exists a spherical cap with normalized area not containing any of these points. We study the behavior of dispC(n,d) as n and d grow to infinity. We develop connections to the problems of sphere covering and approximation of the Euclidean unit ball by inscribed polytopes. Existing and new results are presented in a unified way. Upper bounds on dispC(n,d) result from choosing the points independently and uniformly at random and possibly adding some well-separated points to close large gaps. Moreover, we study dispersion with respect to intersections of caps.
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.