Optimal periodic L2-discrepancy and diaphony bounds for higher order digital sequences
Abstract
We present an explicit construction of infinite sequences of points (x0,x1, x2, …) in the d-dimensional unit-cube whose periodic L2-discrepancy satisfies L2,N per(\x0,x1,…, xN-1\) Cd N-1 ( N)d/2 for all N 2, where the factor Cd > 0 depends only on the dimension d. The construction is based on higher order digital sequences as introduced by J. Dick in the year 2008. The result is best possible in the order of magnitude in N according to a Roth-type lower bound shown first by P.D. Proinov. Since the periodic L2-discrepancy is equivalent to P. Zinterhof's diaphony the result also applies to this alternative quantitative measure for the irregularity of distribution.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.