The biquadratic SOS rank conjecture for 3 by 3 forms

From papers

Let a biquadratic form be a homogeneous polynomial of degree two in each of two variable vectors, and let its SOS rank be the smallest number of squares of bilinear forms in a sum-of-squares representation. Let BSR(3,3)\mathrm{BSR}(3,3) denote the maximum SOS rank among 3×33\times3 biquadratic forms. The biquadratic SOS rank conjecture. For 3×33\times3 biquadratic forms,

BSR(3,3)=6.\mathrm{BSR}(3,3)=6.

The known bounds are 6BSR(3,3)86\le \mathrm{BSR}(3,3)\le 8, while the value 66 is attained by a 3×33\times3 simple biquadratic form. Determining whether every 3×33\times3 biquadratic form has SOS rank at most six remains open.

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, Chufeng Cui and Liqun Qi, “On the SOS Rank of Simple and Diagonal Biquadratic Forms”, arXiv:2601.19195 (2026).

Solutions 0

No solutions have been posted yet.