The grand discrepancy conjecture for infinite sequences

Let sNs\in\mathbb{N} and let S\mathcal{S} be a sequence in [0,1)s[0,1)^s. Write DN(S)D_N^{\ast}(\mathcal{S}) for its star discrepancy at NN points. Grand discrepancy conjecture. For every sNs\in\mathbb{N} there exists a constant cs>0c_s>0 such that, for every sequence S\mathcal{S} in [0,1)s[0,1)^s,

DN(S)cs(logN)sND_N^{\ast}(\mathcal{S})\geq c_s\frac{(\log N)^s}{N}

for infinitely many NN. Except in dimension one, this would close the gap between the known lower and upper bounds for the star discrepancy of infinite sequences; the conjecture is presented as a major open problem in discrepancy theory, although the source notes that it is not universally accepted.

Sources & referencesView supporting material

Primary source

Friedrich Pillichshammer, “Discrepancy of Digital Sequences: New Results on a Classical QMC Topic”, arXiv:1904.10346 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.