2000 character limit reached
On the lower bound of the discrepancy of $(t,s)$ sequences: II
Published 19 May 2015 in math.NT | (1505.04975v2)
Abstract: Let $ (\bx(n)){n \geq 1} $ be an $s-$dimensional Niederreiter-Xing sequence in base $b$. Let $D((\bx(n)){n = 1}{N})$ be the discrepancy of the sequence $ (\bx(n)){n = 1}{N} $. It is known that $N D((\bx(n)){n = 1}{N}) =O(\lns N)$ as $N \to \infty $. In this paper, we prove that this estimate is exact. Namely, there exists a constant $K>0$, such that $$ \inf_{\bw \in [0,1)s} \sup_{1 \leq N \leq bm} N D((\bx(n)\oplus \bw)_{n = 1}{N}) \geq K ms \quad {\rm for} \; \; m=1,2,...\;. $$ We also get similar results for other explicit constructions of $(t,s)$ sequences.
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.