Digital nets in dimension two with the optimal order of Lp discrepancy
Abstract
We study the Lp discrepancy of two-dimensional digital nets for finite p. In the year 2001 Larcher and Pillichshammer identified a class of digital nets for which the symmetrized version in the sense of Davenport has L2 discrepancy of the order N/N, which is best possible due to the celebrated result of Roth. However, it remained open whether this discrepancy bound also holds for the original digital nets without any modification. In the present paper we identify nets from the above mentioned class for which the symmetrization is not necessary in order to achieve the optimal order of Lp discrepancy for all p ∈ [1,∞). Our findings are in the spirit of a paper by Bilyk from 2013, who considered the L2 discrepancy of lattices consisting of the elements (k/N,\k α\) for k=0,1,…,N-1, and who gave Diophantine properties of α which guarantee the optimal order of L2 discrepancy.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.