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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.