The greedy-Haar thinning discrepancy conjecture
Statement
Let and let . A greedy-Haar -thinning strategy produces a sequence , and write for its first points. Let denote their discrepancy. Greedy-Haar thinning discrepancy conjecture. The sequence almost surely satisfies
This conjecture predicts a further logarithmic improvement for the empirically more efficient greedy-Haar strategy, beyond the conjectured bound for the Haar strategy; it is presented as a heuristic conjecture and remains open in the source.
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.