Alexander E Litvak, Mathias Sonnleitner, Tomasz Szczepanski
{"title":"Minimal Dispersion on the Sphere.","authors":"Alexander E Litvak, Mathias Sonnleitner, Tomasz Szczepanski","doi":"10.1007/s00454-025-00812-8","DOIUrl":null,"url":null,"abstract":"<p><p>The minimal spherical cap dispersion <math> <mrow> <msub><mrow><mspace></mspace> <mtext>disp</mtext> <mspace></mspace></mrow> <mi>C</mi></msub> <mrow><mo>(</mo> <mi>n</mi> <mo>,</mo> <mi>d</mi> <mo>)</mo></mrow> </mrow> </math> is the largest number <math><mrow><mi>ε</mi> <mo>∈</mo> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>]</mo></mrow> </math> such that, for every <i>n</i> points on the <i>d</i>-dimensional Euclidean unit sphere <math> <msup><mrow><mi>S</mi></mrow> <mi>d</mi></msup> </math> , there exists a spherical cap with normalized area <math><mi>ε</mi></math> not containing any of these points. We study the behavior of <math> <mrow> <msub><mrow><mspace></mspace> <mtext>disp</mtext> <mspace></mspace></mrow> <mi>C</mi></msub> <mrow><mo>(</mo> <mi>n</mi> <mo>,</mo> <mi>d</mi> <mo>)</mo></mrow> </mrow> </math> as <i>n</i> and <i>d</i> 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 <math> <mrow> <msub><mrow><mspace></mspace> <mtext>disp</mtext> <mspace></mspace></mrow> <mi>C</mi></msub> <mrow><mo>(</mo> <mi>n</mi> <mo>,</mo> <mi>d</mi> <mo>)</mo></mrow> </mrow> </math> 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.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"76 3","pages":"1293-1321"},"PeriodicalIF":0.7000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13619639/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-025-00812-8","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/8/20 0:00:00","PubModel":"Epub","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The minimal spherical cap dispersion is the largest number such that, for every n points on the d-dimensional Euclidean unit sphere , there exists a spherical cap with normalized area not containing any of these points. We study the behavior of 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 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 (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.