Search arXivSearch

arXiv · 2606.11194

The SOS Rank of a $5 \times 4$ Biquadratic Form via Orthogonality

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 $(m,n)$, the maximum possible SOS rank over all biquadratic forms in $m$ and $n$ variables is denoted $\operatorname{BSR}(m,n)$. Recent advances have established lower bounds on $\operatorname{BSR}(m,n)$ via combinatorial constructions involving bipartite graphs and the orthogonality method. In particular, for the case $(m,n)=(5,4)$, it was shown that $\operatorname{BSR}(5,4)\ge 11$ using only nondegenerate 2-edges. In this paper, we extend this framework by incorporating a degenerate $2$-edge, which introduces a cross term where the two $y$-indices coincide. We construct an explicit $5\times 4$ biquadratic form and apply the orthogonality method to prove that its SOS rank is $12$, thereby improving the lower bound to $\operatorname{BSR}(5,4)\ge12$. This result demonstrates that degenerate $2$-edges yield additional algebraic flexibility beyond purely combinatorial bounds and extends the applicability of the orthogonality method to forms with cross terms involving identical $y$-indices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yannan Chen. 2026-03-28. The SOS Rank of a $5 \times 4$ Biquadratic Form via Orthogonality. https://arxiv.org/abs/2606.11194

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO