ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A1,…,AdA_1,\ldots,A_d be the positive semidefinite matrices in the paper's optimization problem, let Sk\mathcal{S}_k denote the family of kk-element subsets of {1,…,d}\{1,\ldots,d\}, and let μ(x)\mu(x) be the normalized weight

μ(x)=⟨v,x⟩2(k−1)Ex[⟨v,x⟩2(k−1)].\mu(x)=\frac{\langle v,x\rangle^{2(k-1)}}{\mathbb{E}_x[\langle v,x\rangle^{2(k-1)}]}.

Pseudodistribution product inequality.

(∏i=1dEx[μ(x)⟨x,Aix⟩])(d−1k−1)≥∏I∈SkEx[∏i∈I⟨x,Aix⟩].\left(\prod_{i=1}^d\mathbb{E}_x\left[\mu(x)\langle x,A_i x\rangle\right]\right)^{\binom{d-1}{k-1}} \geq \prod_{I\in\mathcal{S}_k}\mathbb{E}_x\left[\prod_{i\in I}\langle x,A_i x\rangle\right].

If true, this inequality would imply that \textscOptSOSk(A)\textsc{OptSOS}_k(\mathcal{A}) has approximation factor e−C(n,k)e^{-C(n,k)}. The supplied span does not establish resolution, and the notation for the distributions, expectation functional, and matrix assumptions is only partially present in the excerpt.

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.