2000 character limit reached
Digital almost nets
Published 25 Feb 2021 in math.CO and cs.CG | (2102.12872v3)
Abstract: Digital nets (in base $2$) are the subsets of $[0,1]d$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.