Minimal Dispersion on the Sphere

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

Authors

Institutions

Publication Details

Journal
Discrete & Computational Geometry
Published
2026-08-20
DOI
https://doi.org/10.1007/s00454-025-00812-8
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimal Dispersion on the Sphere

Alexander E. Litvak, Tomasz Szczepański, Mathias Sonnleitner
Discrete & Computational Geometry
Point processes and geometric inequalities
article

Minimal Dispersion on the Sphere

Alexander E. Litvak, Tomasz Szczepański, Mathias Sonnleitner
article en

Abstract

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

Discrete & Computational Geometry
University of Alberta (CA)
Austrian Science Fund
Openalex Percentile: Top 95%
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Minimal Dispersion on the Sphere — Alexander E. Litvak, Tomasz Szczepański, et al. · Discrete & Computational Geometry (2026) | TGRS Research Map | TGRS