Bruce Reznick
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Bruce Reznick has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Victoria Powers
Emory University
3 shared publications - Charu Goel2 shared publications
- Grigoriy Blekherman
Georgia Institute of Technology
2 shared publications - Jennifer Weber Lansing
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, USA
2 shared publications - Jeremy T. Tyson
University of Illinois, Urbana-Champaign
2 shared publications - Kevin O'Bryant
University of California at San Diego
2 shared publications
Latest Publications
- Open Access
- 27 April 2026
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 14
On odd powers of nonnegative polynomials that are not sums of squares
We initiate a systematic study of nonnegative polynomials P such that $P^k$ is not a sum of squares for any odd $k\geq 1$ , calling such P stubborn . We develop a new invariant of a real isolated zero of a nonnegative polynomial in the plane, that we call the SOS-invariant , and relate it to the well-known delta invariant of a plane curve singularity. Using the SOS-invariant we show that any polynomial that spans an extreme ray of the convex cone of nonnegative ternary forms of degree 6 is stubborn. We also show how to use the SOS-invariant to prove stubbornness of ternary forms in higher degree. Furthermore, we prove that in a given degree and number of variables, nonnegative polynomials that are not stubborn form a convex cone, whose interior consists of all strictly positive polynomials.- 27 April 2026
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 14
Open AccessOn odd powers of nonnegative polynomials that are not sums of squares
We initiate a systematic study of nonnegative polynomials P such that $P^k$ is not a sum of squares for any odd $k\geq 1$ , calling such P stubborn . We develop a new invariant of a real isolated zero of a nonnegative polynomial in the plane, that we call the SOS-invariant , and relate it to the well-known delta invariant of a plane curve singularity. Using the SOS-invariant we show that any polynomial that spans an extreme ray of the convex cone of nonnegative ternary forms of degree 6 is stubborn. We also show how to use the SOS-invariant to prove stubbornness of ternary forms in higher degree. Furthermore, we prove that in a given degree and number of variables, nonnegative polynomials that are not stubborn form a convex cone, whose interior consists of all strictly positive polynomials. - Open Access
On odd powers of nonnegative polynomials that are not sums of squares
We initiate a systematic study of nonnegative polynomials $P$ such that $P^k$ is not a sum of squares for any odd $k\geq 1$, calling such $P$ \emph{stubborn}. We develop a new invariant of a real isolated zero of a nonnegative polynomial in the plane, that we call \emph{the SOS-invariant}, and relate it to the well-known delta invariant of a plane curve singularity. Using the SOS-invariant we show that any polynomial that spans an extreme ray of the convex cone of nonnegative ternary forms of degree 6 is stubborn. We also show how to use the SOS-invariant to prove stubbornness of ternary forms in higher degree. Furthermore, we prove that in a given degree and number of variables, nonnegative polynomials that are not stubborn form a convex cone, whose interior consists of all strictly positive polynomials.Open AccessOn odd powers of nonnegative polynomials that are not sums of squares
We initiate a systematic study of nonnegative polynomials $P$ such that $P^k$ is not a sum of squares for any odd $k\geq 1$, calling such $P$ \emph{stubborn}. We develop a new invariant of a real isolated zero of a nonnegative polynomial in the plane, that we call \emph{the SOS-invariant}, and relate it to the well-known delta invariant of a plane curve singularity. Using the SOS-invariant we show that any polynomial that spans an extreme ray of the convex cone of nonnegative ternary forms of degree 6 is stubborn. We also show how to use the SOS-invariant to prove stubbornness of ternary forms in higher degree. Furthermore, we prove that in a given degree and number of variables, nonnegative polynomials that are not stubborn form a convex cone, whose interior consists of all strictly positive polynomials. - Open Access
Sums of squares of k-term forms
In this paper we study the cones corresponding to sums of squares of $n$-ary $d$-ic forms with at most $k$ terms. We show that these are strictly nested as $k$ increases, leading to the usual sum of squares cone. We also discuss the duals of these cones. For $n \ge 3$, we construct indefinite irreducible $n$-ary $d$-ic forms with exactly $k$ terms for $2 \le k \le \binom{n+d-1}{n-1}$.Open AccessSums of squares of k-term forms
In this paper we study the cones corresponding to sums of squares of $n$-ary $d$-ic forms with at most $k$ terms. We show that these are strictly nested as $k$ increases, leading to the usual sum of squares cone. We also discuss the duals of these cones. For $n \ge 3$, we construct indefinite irreducible $n$-ary $d$-ic forms with exactly $k$ terms for $2 \le k \le \binom{n+d-1}{n-1}$. - Open Access
The Non-Tightness of a Convex Relaxation to Rotation Recovery
We study the Perspective-n-Point (PNP) problem, which is fundamental in 3D vision, for the recovery of camera translation and rotation. A common solution applies polynomial sum-of-squares (SOS) relaxation techniques via semidefinite programming. Our main result is that the polynomials which should be optimized can be non-negative but not SOS, hence the resulting convex relaxation is not tight; specifically, we present an example of real-life configurations for which the convex relaxation in the Lasserre Hierarchy fails, in both the second and third levels. In addition to the theoretical contribution, the conclusion for practitioners is that this commonly-used approach can fail; our experiments suggest that using higher levels of the Lasserre Hierarchy reduces the probability of failure. The methods we use are mostly drawn from the area of polynomial optimization and convex relaxation; we also use some results from real algebraic geometry, as well as Matlab optimization packages for PNP.
Open AccessThe Non-Tightness of a Convex Relaxation to Rotation Recovery
We study the Perspective-n-Point (PNP) problem, which is fundamental in 3D vision, for the recovery of camera translation and rotation. A common solution applies polynomial sum-of-squares (SOS) relaxation techniques via semidefinite programming. Our main result is that the polynomials which should be optimized can be non-negative but not SOS, hence the resulting convex relaxation is not tight; specifically, we present an example of real-life configurations for which the convex relaxation in the Lasserre Hierarchy fails, in both the second and third levels. In addition to the theoretical contribution, the conclusion for practitioners is that this commonly-used approach can fail; our experiments suggest that using higher levels of the Lasserre Hierarchy reduces the probability of failure. The methods we use are mostly drawn from the area of polynomial optimization and convex relaxation; we also use some results from real algebraic geometry, as well as Matlab optimization packages for PNP.
- 20 January 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Number Theory
- Vol. 17 (03) , 761-786
Equal sums of two cubes of quadratic forms
- 20 January 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Number Theory
- Vol. 17 (03) , 761-786
Equal sums of two cubes of quadratic forms
- Open Access
Equal sums of two cubes of binary quadratic forms
We give a complete description of all solutions to the equation $f_1^3 + f_2^3 = f_3^3 + f_4^3$ for quadratic forms $f_j \in \mathbb C[x,y]$ and show how Ramanujan's example can be extended to three equal sums of pairs of cubes. We also give a complete census in counting the number of ways a sextic $p \in \mathbb C[x,y]$ can be written as a sum of two cubes. The extreme example is $p(x,y) = xy(x^4-y^4)$, which has six such representations.Open AccessEqual sums of two cubes of binary quadratic forms
We give a complete description of all solutions to the equation $f_1^3 + f_2^3 = f_3^3 + f_4^3$ for quadratic forms $f_j \in \mathbb C[x,y]$ and show how Ramanujan's example can be extended to three equal sums of pairs of cubes. We also give a complete census in counting the number of ways a sextic $p \in \mathbb C[x,y]$ can be written as a sum of two cubes. The extreme example is $p(x,y) = xy(x^4-y^4)$, which has six such representations. - 31 December 2019
- Published by Mathematical Sciences Publishers in Pacific Journal of Mathematics
- Vol. 303 (2) , 729-755
Linearly dependent powers of binary quadratic forms
- 31 December 2019
- Published by Mathematical Sciences Publishers in Pacific Journal of Mathematics
- Vol. 303 (2) , 729-755
Linearly dependent powers of binary quadratic forms
- Open Access
A note on mediated simplices
Many homogeneous polynomials that arise in the study of sums of squares and Hilbert's 17th problem come from monomial substitutions into the arithmetic-geometric inequality. In 1989, the second author gave a necessary and sufficient condition for such a form to have a representation as a sum of squares of forms (Math. Ann., (283), 431--464), involving the arrangement of lattice points in the simplex whose vertices were the $n$-tuples of the exponents used in the substitution. Further, a claim was made, and not proven, that sufficiently large dilations of any such simplex will also satisfy this condition. The aim of this short note is to prove the claim, and provide further context for the result, both in the study of Hilbert's 17th Problem and the study of lattice point simplices.
Open AccessA note on mediated simplices
Many homogeneous polynomials that arise in the study of sums of squares and Hilbert's 17th problem come from monomial substitutions into the arithmetic-geometric inequality. In 1989, the second author gave a necessary and sufficient condition for such a form to have a representation as a sum of squares of forms (Math. Ann., (283), 431--464), involving the arrangement of lattice points in the simplex whose vertices were the $n$-tuples of the exponents used in the substitution. Further, a claim was made, and not proven, that sufficiently large dilations of any such simplex will also satisfy this condition. The aim of this short note is to prove the claim, and provide further context for the result, both in the study of Hilbert's 17th Problem and the study of lattice point simplices.
- Open Access
Linearly dependent powers of binary quadratic forms
Given an integer $d \ge 2$, what is the least $r$ so that there is a set of binary quadratic forms $\{f_1,\dots,f_r\}$ for which $\{f_j^d\}$ is non-trivially linearly dependent? We show that if $r \le 4$, then $d \le 5$, and for $d \ge 4$, construct such a set with $r = \lfloor d/2\rfloor + 2$. Many explicit examples are given, along with techniques for producing others.Open AccessLinearly dependent powers of binary quadratic forms
Given an integer $d \ge 2$, what is the least $r$ so that there is a set of binary quadratic forms $\{f_1,\dots,f_r\}$ for which $\{f_j^d\}$ is non-trivially linearly dependent? We show that if $r \le 4$, then $d \le 5$, and for $d \ge 4$, construct such a set with $r = \lfloor d/2\rfloor + 2$. Many explicit examples are given, along with techniques for producing others. - Open Access
Sparse Versions of the Cayley-Bacharach Theorem
We give combinatorial generalizations of the Cayley-Bacharach theorem and induced map.
Open AccessSparse Versions of the Cayley-Bacharach Theorem
We give combinatorial generalizations of the Cayley-Bacharach theorem and induced map.