Corpus ID: 232046299

Digital almost nets

@article{Bukh2021DigitalAN,
  title={Digital almost nets},
  author={B. Bukh and Ting-Wei Chao},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.12872}
}
Digital nets (in base 2) are the subsets of [0, 1] 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. 

References

SHOWING 1-10 OF 10 REFERENCES
The Probabilistic Method
A Dual Plotkin Bound for $(T,M,S)$ -Nets
Perturbed Identity Matrices Have High Rank: Proof and Applications
  • N. Alon
  • Computer Science, Mathematics
  • Combinatorics, Probability and Computing
  • 2009
Testing k-wise and almost k-wise independence
On convex holes in d-dimensional point sets
Digital nets and sequences
  • 2010
A New Lower Bound on the t-Parameter of (t, s)-Sequences
A new lower bound on the t-parameter of (t, s)-sequences. In Monte Carlo and quasi-Monte Carlo methods
  • 2006