An upper bound on the minimal dispersion

DOI10.1016/j.jco.2017.11.003zbMath1391.05070arXiv1710.06754OpenAlexW3100966797MaRDI QIDQ1704610

Mario Ullrich, Jan Vybíral

Publication date: 12 March 2018

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.06754

zbMATH Keywords

dispersion complexity

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorial aspects of finite geometries (05B25) Combinatorial geometries and geometric closure systems (51D20)

Related Items (18)

Universal discretization ⋮ New bounds on the minimal dispersion ⋮ Minimal dispersion of large volume boxes in the cube ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Dispersion of digital \((0,m,2)\)-nets ⋮ Connections between numerical integration, discrepancy, dispersion, and universal discretization ⋮ Deviation from equidistance for one-dimensional sequences ⋮ Faster algorithms for largest empty rectangles and boxes ⋮ On the dispersion of sparse grids ⋮ The minimal \(k\)-dispersion of point sets in high dimensions ⋮ On the fixed volume discrepancy of the Fibonacci sets in the integral norms ⋮ Expected dispersion of uniformly distributed points ⋮ Improved dispersion bounds for modified Fibonacci lattices ⋮ On the fixed volume discrepancy of the Korobov point sets ⋮ Piercing all translates of a set of axis-parallel rectangles ⋮ Recovery algorithms for high-dimensional rank one tensors ⋮ A remark on the minimal dispersion ⋮ Piercing all translates of a set of axis-parallel rectangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation of high-dimensional rank one tensors
• Sequences, discrepancies and applications
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• A note on minimal dispersion of point sets in the unit cube
• On the dispersion of sparse grids
• Quasi-Monte-Carlo methods and the dispersion of point sequences
• A lower bound for the dispersion on the torus
• On the size of the largest empty box amidst a point set
• Some Results on the Complexity of Numerical Integration
• Global Stochastic Optimization with Low-Dispersion Point Sets
• Discrepancy Theory and Quasi-Monte Carlo Integration
• Tractability of the approximation of high-dimensional rank one tensors

This page was built for publication: An upper bound on the minimal dispersion