For the minimal dispersion \operatorname{disp}^{*}(n,d) of n points in [0,1]^{d}, improve the known upper bound…
Statement
For the minimal dispersion \operatorname{disp}^{}(n,d) of n points in [0,1]^{d}, improve the known upper bound \operatorname{disp}^{}(n,d)\leq\min{c_{1}d/n,c_{2}d\log(n/d)/n}, in particular prove the expected \operatorname{disp}^{}(n,d)\leq c d/n for n\geq d, and improve the lower bound \operatorname{disp}^{}(n,d)\geq\log_{2}d/[4(n+\log_{2}d)].
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.