Dispersion of digital $(0,m,2)$-nets
Metric Geometry
2021-09-14 v1 Combinatorics
Number Theory
Abstract
We study the dispersion of digital -nets; i.e. the size of the largest axes-parallel box within such point sets. Digital nets are an important class of low-discrepancy point sets. We prove tight lower and upper bounds for certain subclasses of digital nets where the generating matrices are of triangular form and compute the dispersion of special nets such as the Hammersley point set exactly.
Cite
@article{arxiv.2004.14760,
title = {Dispersion of digital $(0,m,2)$-nets},
author = {Ralph Kritzinger},
journal= {arXiv preprint arXiv:2004.14760},
year = {2021}
}
Comments
14 pages