The smooth discrepancy lower-bound conjecture

About 8 years old · traced to

For a point set ξ\xi with mm points in the dd-dimensional domain and arbitrary weights, let D∞r,o(m,d)D^{r,o}_\infty(m,d) be the infimum of the rr-discrepancy over all such point-weight pairs. Smooth discrepancy lower-bound conjecture. For all d,r∈Nd,r\in\mathbb N,

D∞r,o(m,d)≥C(r,d)m−r(log⁡m)d−1.D^{r,o}_\infty(m,d) \ge C(r,d)m^{-r}(\log m)^{d-1}.

This generalizes the classical discrepancy lower-bound conjecture to smooth discrepancy and weighted formulas. The stated bound is supported by known lower estimates under restrictions on the weights, but the unrestricted assertion remains open.

References

Primary source

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.