z-logo
open-access-imgOpen Access
On the lower bound of the discrepancy of (t,s) sequences: I
Author(s) -
Mordechay B. Levin
Publication year - 2016
Publication title -
comptes rendus mathématique
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.803
H-Index - 68
eISSN - 1778-3569
pISSN - 1631-073X
DOI - 10.1016/j.crma.2016.02.011
Subject(s) - mathematics , upper and lower bounds , combinatorics , pure mathematics , mathematical analysis
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(\ln^s 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 b^m} N D((\bx(n)\oplus \bw)_{n = 1}^{N}) \geq K m^s \quad {\rm for} \; \; m=1,2,...\;. $$ We also get similar results for other explicit constructions of $(t,s)$ sequences.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom