Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal periodic $L_2$-discrepancy and diaphony bounds for higher order digital sequences (2212.05747v1)

Published 12 Dec 2022 in math.NT, cs.NA, and math.NA

Abstract: We present an explicit construction of infinite sequences of points $(\boldsymbol{x}0,\boldsymbol{x}_1, \boldsymbol{x}_2, \ldots)$ in the $d$-dimensional unit-cube whose periodic $L_2$-discrepancy satisfies $$L{2,N}{{\rm per}}({\boldsymbol{x}0,\boldsymbol{x}_1,\ldots, \boldsymbol{x}{N-1}}) \le C_d N{-1} (\log N){d/2} \quad \mbox{for all } N \ge 2,$$ where the factor $C_d > 0$ depends only on the dimension $d$. The construction is based on higher order digital sequences as introduced by J. Dick in the year 2008. The result is best possible in the order of magnitude in $N$ according to a Roth-type lower bound shown first by P.D. Proinov. Since the periodic $L_2$-discrepancy is equivalent to P. Zinterhof's diaphony the result also applies to this alternative quantitative measure for the irregularity of distribution.

Citations (1)

Summary

We haven't generated a summary for this paper yet.