Lower bounds on the Lp discrepancy of digital NUT sequences
Abstract
We study the Lp discrepancy of digital NUT sequences which are an important sub-class of digital (0,1)-sequences in the sense of Niederreiter. The main result is a lower bound for certain sub-classes of digital NUT sequences.
0
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.