Search Results

Abstract

The star discrepancy $D_N^{*}\left(𝒫\right)$ is a quantitative measure for the irregularity of distribution of a finite point set 𝒫 in the multi-dimensional unit cube which is intimately related to the integration error of quasi-Monte Carlo algorithms. It is known that for every integer N ≥ 2 there are point sets 𝒫 in [0, 1)^d with |𝒫| = N and $D_N^{*}\left(𝒫\right)=O\left({\left(log\hspace{0.17em}N\right)}^{d-1}/N\right)$. However, for small N compared to the dimension d this asymptotically excellent bound is useless (e.g., for N ≤ ed ⁻¹).

In 2001 it has been shown by Heinrich, Novak, Wasilkowski and Woźniakowski that for every integer N ≥ 2there exist point sets 𝒫 in [0, 1)^d with |𝒫| = N and $D_N^{*}\left(𝒫\right)\le C\sqrt{d/N}$. Although not optimal in an asymptotic sense in N, this upper bound has a much better (and even optimal) dependence on the dimension d.

Unfortunately the result by Heinrich et al. and also later variants thereof by other authors are pure existence results and until now no explicit construction of point sets with the above properties is known. Quite recently Löbbe studied lacunary subsequences of Kronecker’s (n α)-sequence and showed a metrical discrepancy bound of the form $C\sqrt{d\left(log\hspace{0.17em}d\right)/N}$ with implied absolute constant C> 0 independent of N and d.

In this paper we show a corresponding result for digital Kronecker sequences, which are a non-archimedean analog of classical Kronecker sequences.