ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For the discrepancy of n points in [0,1]^{d}, improve the stated upper or lower bounds and find explicit point-set constructions attaining the upper bound, especially for star discrepancy, or randomized constructions using less randomness. For dispersion, determine the optimal size of the largest empty axis-parallel box and the complexity of finding it.}

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.