The SOS Rank of a Biquadratic Form via Orthogonality
arXiv:2606.11194
Abstract
Biquadratic forms arise naturally in polynomial optimization, tensor analysis, and quantum information theory. A key problem is determining the minimal number of squares needed in a sum-of-squares (SOS) representation of such a form, known as its SOS rank. For fixed dimensions , the maximum possible SOS rank over all biquadratic forms in and variables is denoted . Recent advances have established lower bounds on via combinatorial constructions involving bipartite graphs and the orthogonality method. In particular, for the case , it was shown that using only nondegenerate 2-edges. In this paper, we extend this framework by incorporating a degenerate -edge, which introduces a cross term where the two -indices coincide. We construct an explicit biquadratic form and apply the orthogonality method to prove that its SOS rank is , thereby improving the lower bound to . This result demonstrates that degenerate -edges yield additional algebraic flexibility beyond purely combinatorial bounds and extends the applicability of the orthogonality method to forms with cross terms involving identical -indices.