Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the upper bound of the $L_2$-discrepancy of Halton's sequence

Published 27 Dec 2020 in math.NT | (2012.14002v1)

Abstract: Let $(H(n)){n \geq 0} $ be a $2-$dimensional Halton's sequence. Let $D{2} ( (H(n)){n=0}{N-1}) $ be the $L_2$-discrepancy of $ (H_n){n=0}{N-1} $. It is known that $\limsup_{N \to \infty } (\log N){-1} D_{2} ( H(n) ){n=0}{N-1} >0$. In this paper, we prove that $$D{2} (( H(n) )_{n=0}{N-1}) =O( \log N) \quad {\rm for} \; \; N \to \infty ,$$ i.e., we found the smallest possible order of magnitude of $L_2$-discrepancy of a 2-dimensional Halton's sequence. The main tool is the theorem on linear forms in the $p$-adic logarithm.

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.

Authors (1)

Collections

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