The star-discrepancy lower-bound conjecture
Let points be chosen in , and let denote the infimum of their discrepancy. Star-discrepancy lower-bound conjecture. For ,
This is the classical great open problem in discrepancy theory, formulated as an excruciatingly difficult problem; the optimal logarithmic exponent is known in several weaker settings but remains open for the discrepancy in dimensions at least three.
References
- Vladimir Temlyakov, “Connections between numerical integration, discrepancy, dispersion, and universal discretization”, arXiv:1812.04489 (2018).
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.