相关论文: Optimal periodic $L_2$-discrepancy and diaphony bo…
The $L_p$-discrepancy is a quantitative measure for the irregularity of distribution modulo one of infinite sequences. In 1986 Proinov proved for all $p>1$ a lower bound for the $L_p$-discrepancy of general infinite sequences in the…
We show that the $\mathcal{L}_2$ discrepancy of the explicitly constructed infinite sequences of points $(\boldsymbol{x}_0,\boldsymbol{x}_1, \boldsymbol{x}_2,...)$ in $[0,1)^s$ over $\mathbb{F}_2$ introduced in [J. Dick, Walsh spaces…
In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy. In 1954 Roth proved a lower bound for the $\mathcal{L}_2$ discrepancy of…
In this paper we provide explicit constructions of digital sequences over the finite field of order 2 in the infinite dimensional unit cube whose first $N$ points projected onto the first $s$ coordinates have $\mathcal{L}_q$ discrepancy…
In this paper we study the extreme and the periodic $L_2$ discrepancy of plane point sets. The extreme discrepancy is based on arbitrary rectangles as test sets whereas the periodic discrepancy uses "periodic intervals", which can be seen…
We study the extreme and the periodic $L_p$ discrepancy of point sets in the $d$-dimensional unit cube. The extreme discrepancy uses arbitrary sub-intervals of the unit cube as test sets, whereas the periodic discrepancy is based on…
We study the extreme $L_p$ discrepancy of infinite sequences in the $d$-dimensional unit cube, which uses arbitrary sub-intervals of the unit cube as test sets. This is in contrast to the classical star $L_p$ discrepancy, which uses…
We study the $L_p$ discrepancy of two-dimensional digital nets for finite $p$. In the year 2001 Larcher and Pillichshammer identified a class of digital nets for which the symmetrized version in the sense of Davenport has $L_2$ discrepancy…
We study the periodic $L_2$-discrepancy of point sets in the $d$-dimensional torus. This discrepancy is intimately connected with the root-mean-square $L_2$-discrepancy of shifted point sets, with the notion of diaphony, and with the worst…
The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper…
Dick proved that all order $2$ digital nets satisfy optimal upper bounds of the $L_2$-discrepancy. We give an alternative proof for this fact using Haar bases. Furthermore, we prove that all digital nets satisfy optimal upper bounds of the…
It is well known that the two-dimensional Hammersley point set consisting of $N=2^n$ elements (also known as Roth net) does not have optimal order of $L_p$-discrepancy for $p \in (1,\infty)$ in the sense of the lower bounds according to…
A great challenge in the analysis of the discrepancy function D_N is to obtain universal lower bounds on the L-infty norm of D_N in dimensions d \geq 3. It follows from the average case bound of Klaus Roth that the L-infty norm of D_N is at…
We use the Haar function system in order to study the $L_2$ discrepancy of a class of digital $(0,n,2)$-nets. Our approach yields exact formulas for this quantity, which measures the irregularities of distribution of a set of points in the…
In 1986, Proinov published an explicit lower bound for the diaphony of both finite and infinite sequences of points in the d-dimensional unit cube. To the best of our knowledge, the proofs of these results were so far only available in a…
The discrepancy of a sequence measures how quickly it approaches a uniform distribution. Given a natural number $d$, any collection of one-dimensional so-called low discrepancy sequences $\left\{S_i:1\le i \le d\right\}$ can be concatenated…
The $\boldsymbol{p}$-adic diaphony as introduced by Hellekalek is a quantitative measure for the irregularity of distribution of a sequence in the unit cube. In this paper we show how this notion of diaphony can be interpreted as worst-case…
We investigate $L_2$-discrepancies of what we call weak Latin hypercubes. In this case it turns out that there is a precise equivalence between the extreme and periodic $L_2$-discrepancy which follows from a much broader result about…
Let $(H(n))_{n \geq 0} $ be a $2-$dimensional Halton's sequence. Let $D_{2} ( (H(n))_{n=0}^{N-1}) $ be the $L_2$-discrepancy of $ (H_n)_{n=0}^{N-1} $. It is known that $\limsup_{N \to \infty } (\log N)^{-1} D_{2} ( H(n) )_{n=0}^{N-1} >0$.…
The theory of digital sequences is a fundamental topic in QMC theory. Digital sequences are prototypes of sequences with low discrepancy. First examples were given by Il'ya Meerovich Sobol' and by Henri Faure with their famous…