Narrowing the Gap: SOS Ranks of $4 \times 3$ Biquadratic Forms and a Lower Bound of $8$
Yi Xu, Chunfeng Cui, Liqun Qi

TL;DR
This paper determines the maximum sum-of-squares rank for certain biquadratic forms in 4x3 variables, narrowing the bounds from 7-11 to exactly 8, and introduces new classes and bounds for these forms.
Contribution
It provides exact rank for simple forms, improved upper bounds for y-deficient forms, and constructs a form with SOS rank exactly 8, advancing understanding of SOS ranks in biquadratic forms.
Findings
Simple forms have SOS rank exactly 7.
Y-deficient forms have an upper bound of 9.
Constructed form requires exactly 8 squares.
Abstract
We investigate the maximum sum-of-squares (SOS) rank of biquadratic forms in the critical case of variables, where the general bounds are currently . By analyzing two important structured subclasses, we obtain exact determinations and improved upper bounds that significantly narrow this gap. For simple biquadratic forms those containing only distinct terms of the type we prove that the maximum achievable SOS rank is exactly 7, a value attained by a form corresponding to a -free bipartite graph with the maximum number of edges. This settles the question for simple forms. For -deficient biquadratic forms a class introduced here that permits cross terms among two of the three -variables while the third appears only in pure square terms we prove an upper bound of by combining Calder\"{o}n's theorem on $m\times…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Limits and Structures in Graph Theory · Polynomial and algebraic computation
