The five-square conjecture for 3 × 3 symmetric PSD biquadratic forms

From papers

Let P(x,y)P(\mathbf{x},\mathbf{y}) be a 3×33 \times 3 symmetric PSD biquadratic form, so P(x,y)0P(\mathbf{x},\mathbf{y})\geq 0 for all x,yR3\mathbf{x},\mathbf{y}\in\mathbb{R}^3. A bilinear form is a polynomial linear in each of x\mathbf{x} and y\mathbf{y} separately. Five-square conjecture. Every 3×33 \times 3 symmetric PSD biquadratic form can always be expressed as the sum of at most five squares of bilinear forms. The paper proves the weaker SOS statement for all symmetric PSD biquadratic forms and notes that the bound five is suggested by explicit decompositions and the known rank of an interior example, but it remains unproved.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Yi Xu, Chunfeng Cui and Liqun Qi, “Sum of Squares Decompositions for Structured Biquadratic Forms”, arXiv:2512.02734 (2025).

Solutions 0

No solutions have been posted yet.