ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TkT_k be the kk-term arithmetic-progression count on a finite set Ω\Omega of size NN, and let GW⁡(Tk/N)\operatorname{GW}(T_k/N) denote the Gaussian width of the set of normalized gradients of TkT_k. For fixed k≥4k\geq 4, the authors conjecture that

Gaussian-width conjecture. For any fixed k≥4k \ge 4,

GW⁡(Tk/N)=N(log⁡N)O(1).\operatorname{GW}(T_k/N) = \sqrt{N} (\log N)^{O(1)}.

The authors have the lower bound GW⁡(Tk/N)≳N\operatorname{GW}(T_k/N)\gtrsim\sqrt N, so this conjecture asserts that the lower bound is essentially tight up to polylogarithmic factors. It would sharpen the available Gaussian-width bounds for arithmetic-progression counts.

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.