Score: 1

Minimal dispersion on the sphere

Published: May 16, 2025 | arXiv ID: 2505.10929v1

By: Alexander E. Litvak, Mathias Sonnleitner, Tomasz Szczepanski

Potential Business Impact:

Finds biggest empty spot on a ball.

Business Areas:
Ultimate Frisbee Sports

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, no matter how $n$ points are distributed on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there is always a spherical cap with normalized area $\varepsilon$ not containing any of the points. We study the behavior of ${\rm disp}_{\mathcal{C}}(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 disp}_{\mathcal{C}}(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.

Country of Origin
🇨🇦 🇦🇹 Austria, Canada

Page Count
28 pages

Category
Mathematics:
Metric Geometry