Optimal -discrepancy bounds for second order digital sequences
arXiv:1601.07281 · doi:10.1007/s11856-017-1555-2
Abstract
The -discrepancy is a quantitative measure for the irregularity of distribution modulo one of infinite sequences. In 1986 Proinov proved for all a lower bound for the -discrepancy of general infinite sequences in the -dimensional unit cube, but it remained an open question whether this lower bound is best possible in the order of magnitude until recently. In 2014 Dick and Pillichshammer gave a first construction of an infinite sequence whose order of -discrepancy matches the lower bound of Proinov. Here we give a complete solution to this problem for all finite . We consider so-called order digital -sequences over the finite field with two elements and show that such sequences achieve the optimal order of -discrepancy simultaneously for all .
arXiv commentA journal requested to split the paper into two parts. This is the first part which contains the results on the discrepancy
References in corpus (7)
- Walsh spaces containing smooth functions and quasi-Monte Carlo rules of arbitrary high order
- Explicit constructions of quasi-Monte Carlo rules for the numerical integration of high dimensional periodic functions
- From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules
- Quasi-Monte Carlo methods for integration of functions with dominating mixed smoothness in arbitrary dimension
- Discrepancy and integration in function spaces with dominating mixed smoothness
- Exponential Squared Integrability for the Discrepancy Function in Two Dimensions
- L_p- and S_{p,q}^rB-discrepancy of (order 2) digital nets