An upper bound on the minimal dispersion.

Journal of Complexity(2018)

引用 23|浏览32
暂无评分
摘要
For ε∈(0,1∕2) and a natural number d≥2, let N be a natural number with N≥29log2(d)log2(1∕ε)ε2.We prove that there is a set of N points in the unit cube [0,1]d, which intersects all axis-parallel boxes with volume ε. That is, the dispersion of this point set is bounded from above by ε.
更多
查看译文
关键词
Dispersion,Complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要