Digital almost nets
Combinatorics
2022-09-28 v3 Computational Geometry
Abstract
Digital nets (in base ) are the subsets of that contain the expected number of points in every not-too-small dyadic box. We construct sets that contain almost the expected number of points in every such box, but which are exponentially smaller than the digital nets. We also establish a lower bound on the size of such almost nets.
Cite
@article{arxiv.2102.12872,
title = {Digital almost nets},
author = {Boris Bukh and Ting-Wei Chao},
journal= {arXiv preprint arXiv:2102.12872},
year = {2022}
}
Comments
9 pages