Related papers: Macaulay representation of the prolongation matrix…
Let $z\in\mathbb C^n$ and $\|z\|$ be its Euclidean norm. Ebenfelt proposed a conjecture regarding the possible ranks of the Hermitian polynomials in $z,\bar z$ of the form $A(z,\bar z)\|z\|^2$, known as the SOS Conjecture, where SOS stands…
Let $z\in \mathbb C^n$ be the complex coordinates on $\mathbb C^n$, and $A(z,\bar z)$ be a real-valued Hermitian polynomial. The famous Ebenfelt's SOS conjecture asks for the minimum rank of $A(z,\bar z)\|z\|^2$ under the restriction that…
We study real bihomogeneous polynomials $r(z,\bar{z})$ in $n$ complex variables for which $r(z,\bar{z}) \|z\|^2$ is the squared norm of a holomorphic polynomial mapping. Such polynomials are the focus of the Sum of Squares Conjecture, which…
The goal of this article is to prove the Sum of Squares Conjecture for real polynomials $r(z,\bar{z})$ on $\mathbb{C}^3$ with diagonal coefficient matrix. This conjecture describes the possible values for the rank of $r(z,\bar{z}) \|z\|^2$…
We study the sum-of-squares (SOS) rank of simple and diagonal biquadratic forms. For simple biquadratic forms in $3 \times 3$ variables, we show that the maximum SOS rank is exactly $6$, attained by a specific six-term form. We further…
This paper introduces the concepts of the augmented Zarankiewicz number $z_A(m,n)$ and the limited augmented Zarankiewicz number $z_L(m,n)$, which are natural combinatorial extensions of the classical Zarankiewicz number. These numbers…
We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…
We investigate the maximum sum-of-squares (SOS) rank of biquadratic forms in the critical case of $4 \times 3$ variables, where the general bounds are currently $7 \leq \mathrm{BSR}(4,3) \leq 11$. By analyzing two important structured…
This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…
Recently Lieb and Seiringer showed that the Bessis-Moussa-Villani conjecture from quantum physics can be restated in the following purely algebraic way: The sum of all words in two positive semidefinite matrices where the number of each of…
We find the minimum scale factor, for which the nonnegative B\"ottcher-Wenzel biquadratic form becomes a sum of squares (sos). To this we give the primal and dual solutions for the underlying semide finite program. Moreover, for special…
The abbreviations LMI and SOS stand for `linear matrix inequality' and `sum of squares', respectively. The cone $\Sigma_{n,2d}$ of SOS polynomials in $n$ variables of degree at most $2d$ is known to have a semidefinite extended formulation…
Denote the maximum sos rank of $m \times n$ sum of squares (SOS) biquadratic forms by $BSR(m, n)$. In this paper, we show that $BSR(m, n) \ge z(m, n)$ and conjecture that $BSR(m, n) = z(m, n)$, where $z(m, n)$ is the Zarankiewicz number.…
In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…
We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros).…
We study SOS properties of biquadratic forms. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that every PSD partially symmetric biquadratic…
Hilbert proved in 1888 that a positive semi-definite (PSD) homogeneous quartic polynomial of three variables always can be expressed as the sum of squares (SOS) of three quadratic polynomials, and a psd homogeneous quartic polynomial of…
To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…
We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…
We show that the polynomial S_{m,k}(A,B), that is the sum of all words in noncommuting variables A and B having length m and exactly k letters equal to B, is not equal to a sum of commutators and Hermitian squares in the algebra R<X,Y>…