Minimal dispersion on the cube and the torus
Andrii Arman, Alexander E. Litvak

TL;DR
This paper improves upper bounds for minimal dispersion on the cube and torus by introducing a novel probabilistic lemma that combines random and deterministic point selection, leading to tighter bounds.
Contribution
The paper presents a new probabilistic lemma that enhances upper bounds for minimal dispersion, combining random and non-random point choices.
Findings
Improved upper bounds for minimal dispersion on the cube.
Enhanced bounds for minimal dispersion on the torus.
Introduction of a novel probabilistic lemma for dispersion analysis.
Abstract
We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion in several previous works. Our new lemma combines a random and non-random choice of points in the cube. This leads to better upper bounds for the minimal dispersion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpectral Theory in Mathematical Physics · Advanced Mathematical Physics Problems · Numerical methods in inverse problems
