Positive semidefinite diagonal minus tail forms are sums of squares
It is one of the main questions in real algebra whether a positive semidefinite (psd) polynomial is a sum of squares (sos) of polynomials. By Hilbert, not every psd form is sos. The first explicit example was given by Motzkin. A result of Hurwitz states that every form \(a_1x_1^{2d}+\ldots+a_nx_n^{2d}-2dx_1^{a_1}\cdots x_n^{a_n}\), where \(a_i\in\mathbb{Z}_{\geq 0}\) have sum \(2d\), is sos. The authors of the paper under review extend Hurwitz's theorem. They introduce the notion of a diagonal minus tail (dmt) form. This is a form \(F(x)=D(x)-T(x)\) where the diagonal part \(D(x)\) has the shape \(D(x)=\sum_{i=1}^nb_ix_i^{2d}\) with \(d\in\mathbb{Z}_{\geq 1}\) and \(b_i\geq 0\), and the tail \(T(x)\) has the shape \(T(x)=\sum_{i\in I}a_ix^i\) with \(a_i\geq 0\) and \(I\subseteq\{i=(i_1,\ldots,i_n)\in\mathbb{Z}^n_{\geq 0}: i_1,\ldots,i_n\leq 2d-1, i_1+\ldots+i_n=2d\}\). The main result of the article states that every psd dmt form is a sum of binomial and monomial squares (sbs). This is done in an algorithmic way.
- A quantitative version of Hurwitz' theorem on the arithmetic-geometric inequality.
- An algorithm for sums of squares of real polynomials
- Forms derived from the arithmetic-geometric inequality
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Lower bounds for a polynomial in terms of its coefficients
- Modern Multiplier Rules
- Positive polynomials and sums of squares
- Semidefinite programming relaxations for semialgebraic problems
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Sufficient conditions for a real polynomial to be a sum of squares
- Sums of squares, moment matrices and optimization over polynomials
- On sums of squares of \(K\)-nomials
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- High-order sum-of-squares structured tensors: theory and applications
- The Laplacian of a uniform hypergraph
- Minkowski's inequality and sums of squares
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Sufficient conditions for a real polynomial to be a sum of squares of polynomials
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Lower bounds on the global minimum of a polynomial
- Further results on sum-of-squares tensors
- Positive semidefinite forms and sums of squares
- Lower bounds for a polynomial in terms of its coefficients
- Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Study of the cone of sums of squares plus sums of nonnegative circuit forms
This page was built for publication: Positive semidefinite diagonal minus tail forms are sums of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658336)
