Papers › Strictly positive polynomials in the boundary of the SOS cone
Strictly positive polynomials in the boundary of the SOS cone
Santiago Laplagne, Marcelo Valdettaro
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the boundary of the cone of real polynomials that can be decomposed as a sum of squares (SOS) of real polynomials. This cone is included in the cone of nonnegative polynomials and both cones share a part of their boundary, which corresponds to polynomials that vanish at at least one point. We focus on the part of the boundary which is not shared, corresponding to strictly positive polynomials. For the cases of polynomials of degree 6 in 3 variables and degree 4 in 4 variables, this boundary has been completely characterized by G. Blekherman. For the cases of more variables or higher degree, results by G. Blekherman, R. Sinn and M. Velasco and other authors based on general conjectures give bounds for the maximum number of polynomials that can appear in a SOS decomposition and the maximum rank of the matrices in the Gram spectrahedron. Combining theoretical results and computational techniques, we compute examples that allow us to prove the optimality of the bounds for all degrees and number of variables. Additionally, we give examples for the following problems: examples in the boundary of the cone that are the sum of less than n squares and have common complex roots, and examples of polynomials in the boundary with length larger than the expected from the dimension.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections