Digital almost nets (Q2112558)

Summary: Digital nets (in base 2) are the subsets of \([0,1]^d\) that contain exactly the expected number of points in every not-too-small dyadic box. We construct finite sets, which we call ``almost nets'', such that every such dyadic box contains almost the expected number of points from the set, but whose size is exponentially smaller than the one of nets. We also establish a lower bound on the size of such almost nets.