Explicit constructions of point sets and sequences with low discrepancy

From MaRDI portal
Publication:3464508




Abstract: In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of mathcalLq discrepancy. In 1954 Roth proved a lower bound for the mathcalL2 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 mathcalLq 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 mathcalL2 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 mathcalLq discrepancy of finite point sets for qin(1,infty). The main aim of this article is to give an overview of these constructions and related results.




Cited in
(24)






This page was built for publication: Explicit constructions of point sets and sequences with low discrepancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464508)