English

Minimal dispersion on the sphere

Metric Geometry 2025-12-10 v2 Numerical Analysis Numerical Analysis

Abstract

The minimal spherical cap dispersion dispC(n,d){\rm disp}_{\mathcal{C}}(n,d) is the largest number ε(0,1]\varepsilon\in (0,1] such that, for every nn points on the dd-dimensional Euclidean unit sphere Sd\mathbb{S}^d, there exists a spherical cap with normalized area ε\varepsilon not containing any of these points. We study the behavior of dispC(n,d){\rm disp}_{\mathcal{C}}(n,d) as nn and dd 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){\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.

Keywords

Cite

@article{arxiv.2505.10929,
  title  = {Minimal dispersion on the sphere},
  author = {Alexander E. Litvak and Mathias Sonnleitner and Tomasz Szczepanski},
  journal= {arXiv preprint arXiv:2505.10929},
  year   = {2025}
}

Comments

30 pages

R2 v1 2026-06-28T23:35:28.476Z