ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix 1<α<21<\alpha<2, set T=NαT=N^\alpha, and let MranM_{ran} be a random T×NT\times N Gaussian matrix. Let v∈RNv\in\mathbb R^N satisfy ∥v∥∞≤1\|v\|_\infty\leq1, and suppose ∣(Mranv)j∣≥Nσ|(M_{ran}v)_j|\geq N^\sigma for every j∈Wj\in W. Constant-degree sum-of-squares barrier conjecture. If σ≤1−α/4\sigma\leq1-\alpha/4 and c>0c>0, then the degree-O(1)O(1) sum-of-squares method cannot prove

∣W∣≲Nα+1−2σ−c.|W|\lesssim N^{\alpha+1-2\sigma-c}.

The claim is attributed to the cited work of D'Hart and collaborators and is presented as a conjectural limitation of constant-degree sum-of-squares proofs; the supplied text gives no resolution.

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.