Explicit constructions of point sets and sequences with low discrepancy

Abstract

In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of Lq discrepancy. In 1954 Roth proved a lower bound for the L2 discrepancy of finite point sets in the unit cube of arbitrary dimension. Later various authors extended Roth's result to lower bounds also for the Lq discrepancy and for infinite sequences. While it was known already from the early 1980s on that Roth's lower bound is best possible in the order of magnitude, it was a longstanding open question to find explicit constructions of point sets and sequences with optimal order of L2 discrepancy. This problem was solved by Chen and Skriganov in 2002 for finite point sets and recently by the authors of this article for infinite sequences. These constructions can also be extended to give optimal order of the Lq discrepancy of finite point sets for q ∈ (1,∞). The main aim of this article is to give an overview of these constructions and related results.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…