2025/05/16 by Litvak, Alexander E., Sonnleitner, Mathias, Szczepanski, Tomasz
#52B55 #52C17 (Primary) 52A23 #52C45 (Secondary) #FOS: Mathematics #Metric Geometry (math.MG) #Numerical Analysis (math.NA)
paper · doi:10.48550/arxiv.2505.10929
The minimal spherical cap dispersion \rm dispC(n,d) is the largest number ε∈ (0,1] such that, no matter how n points are distributed on the d-dimensional Euclidean unit sphere \mathbbSd, there is always a spherical cap with normalized area ε not containing any of the points. We study the behavior of \rm 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 \rm 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.