Minimal Dispersion on the Sphere.

IF 0.7 3区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Discrete & Computational Geometry Pub Date : 2026-01-01 Epub Date: 2026-08-20 DOI:10.1007/s00454-025-00812-8
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 disp C ( n , d ) is the largest number ε ∈ ( 0 , 1 ] such that, for every n points on the d-dimensional Euclidean unit sphere S d , there exists a spherical cap with normalized area ε not containing any of these points. We study the behavior of 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 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.

球面上的最小色散。
最小球帽色散分布C (n, d)是最大的数ε∈(0,1),使得在d维欧几里德单位球S d上,对于每n个点,存在一个归一化面积ε不包含这些点的球帽。我们研究了当n和d趋于无穷时,p C (n, d)的行为。我们发展了球面覆盖问题和欧几里德单位球的内切多面体逼近问题的联系。现有的和新的结果以统一的方式呈现。C (n, d)的上界是由随机独立均匀地选择点,并可能添加一些分离良好的点来关闭大的间隙而产生的。此外,我们还研究了关于帽的交叉点的色散。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete & Computational Geometry
Discrete & Computational Geometry 数学-计算机:理论方法
CiteScore
1.80
自引率
12.50%
发文量
99
审稿时长
6-12 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书