The $L\log L$-Luxemburg Discrepancy for Nonnegative Weights Suffers from the Curse of Dimensionality

Abstract

We study the normalized discrepancy in the Luxemburg norm generated by $\Phi (s)=s\log (1+s)$. For arbitrary nonnegative quadrature weights, we prove that the associated information complexity suffers from the curse of dimensionality: for every $\epsilon \in (0,1)$, there exist constants $c_{\epsilon }>0$ and $d_0=d_0(\epsilon )\in \mathbb{N}$ such that \[N_{Φ,+}(\varepsilon,d)\ge c_{\varepsilon} d^{-1}(1.07735\ldots)^d \qquad \mbox{for all } d\ge d_0. \] The result therefore also applies to equal-weight quasi-Monte Carlo rules.