ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f∈Sym⁡2dVf\in \operatorname{Sym}^{2d}V be generic of SOS-rank k≤nk\leq n, and let

N=(n+dd).N=\binom{n+d}{d}.

For a decomposition of ff into kk squares, write A∈Ck⊗CNA\in\mathbb C^k\otimes\mathbb C^N for the coefficient matrix and let W0+C0W_0+C_0 be its Gram matrix, where x(W0+C0)xt=fx(W_0+C_0)x^t=f. The space of such decompositions is Uniqueness conjecture.

SOSk(f)≅A∈Ck⊗CN∣AtA=W,xWxt=f=A∈Ck⊗CN∣AtA=W0+C0=O(k).\mathrm{SOS}_k(f)\cong\\{A\in\mathbb C^k\otimes\mathbb C^N\mid A^tA=W,\\ xWx^t=f\\}=\\{A\in\mathbb C^k\otimes\mathbb C^N\mid A^tA=W_0+C_0\\}=\mathrm O(k).

Thus, a generic form of SOS-rank at most nn has only one orthogonal orbit of minimal sum-of-squares decompositions. The preceding discussion establishes this behavior for the cases k≤6k\leq 6 listed in the paper's table; the conjecture asserts it for all generic forms with k≤nk\leq n.

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.