Uniform distribution via lattices: from point sets to sequences
Abstract
In this work we construct many sequences S=Sb,d, or S=Sb,d in the d--dimensional unit hypercube, which for d=1 are (generalized) van der Corput sequences or Niederreiter's (0,1)-sequences in base b respectively. Further, we introduce the notion of f-sublinearity and use it to define discrepancy functions which subsume the notion of Lp-discrepancy, Wasserstein p-distance, and many more methods to compare empirical measures to an underlying base measure. We will relate bounds for a given discrepancy functions D of the multiset of projected lattice sets P(b-mZd), to bounds of D(ZN), i.e. the initial segments of the sequence Z=P(S) for any N∈N. We show that this relation holds in any dimension d, for any map P defined on a hypercube, and any discrepancy function as introduced in this work for which bounds on P(b-mZd+v) can be obtained. We apply this theorem in d=1 to obtain bounds for the Lp--discrepancy of van der Corput and Niederreiter (0,1) sequences in terms of digit sums for all 0<p≤ ∞. In d=2 an application of our construction yields many sequences on the two-sphere, such that the initial segments ZN have low L∞--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.