ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d∈Nd\in\mathbb{N} and let β∈(0,1]\beta\in(0,1]. A greedy-Haar (1+β)(1+\beta)-thinning strategy produces a sequence Z=(Zn)n≥1Z=(Z_n)_{n\geq 1}, and write Zn=(Z1,…,Zn)Z^n=(Z_1,\ldots,Z_n) for its first nn points. Let Dis⁡(Zn)\operatorname{Dis}(Z^n) denote their discrepancy. Greedy-Haar thinning discrepancy conjecture. The sequence ZZ almost surely satisfies

lim sup⁡n→∞Dis⁡(Zn)log⁡d+1(n)<∞.\limsup_{n\to\infty}\frac{\operatorname{Dis}(Z^n)}{\log^{d+1}(n)}<\infty.

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 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.