Papers
Topics
Authors
Recent
Search
2000 character limit reached

$L_p$-discrepancy of the symmetrized van der Corput sequence

Published 12 Jan 2015 in math.NT | (1501.02552v1)

Abstract: It is well known that the $L_p$-discrepancy for $p \in [1,\infty]$ of the van der Corput sequence is of exact order of magnitude $O((\log N)/N)$. This however is for $p \in (1,\infty)$ not best possible with respect to the lower bounds according to Roth and Proinov. For the case $p=2$ it is well known that the symmetrization trick due to Davenport leads to the optimal $L_2$-discrepancy rate $O(\sqrt{\log N}/N)$ for the symmetrized van der Corput sequence. In this note we show that this result holds for all $p \in (1,\infty)$. The proof is based on an estimate of the Haar coefficients of the corresponding local discrepancy and on the use of the Littlewood-Paley inequality.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.