On the lower bound of the discrepancy of (t,s) sequences: II

Abstract

Let ((n))n ≥ 1 be an s-dimensional Niederreiter-Xing sequence in base b. Let D(((n))n = 1N) be the discrepancy of the sequence ((n))n = 1N . It is known that N D(((n))n = 1N) =O(s N) as N ∞ . In this paper, we prove that this estimate is exact. Namely, there exists a constant K>0, such that ∈f ∈ [0,1)s 1 ≤ N ≤ bm N D(((n) )n = 1N) ≥ K ms for \; \; m=1,2,...\;. We also get similar results for other explicit constructions of (t,s) sequences.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…