English
Related papers

Related papers: Degree bounds for Putinar's Positivstellensatz on …

200 papers

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

alg-geom · Mathematics 2008-02-03 Ricardo Garcia Lopez

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…

Optimization and Control · Mathematics 2026-01-21 Liqun Qi , Chunfeng Cui , Yi Xu

In this paper we give a version of Krivine-Stengle's Positivstellensatz, Schweighofer's Positivstellensatz, Scheiderer's local-global principle, Scheiderer's Hessian criterion and Marshall's boundary Hessian conditions for polynomial…

Algebraic Geometry · Mathematics 2019-02-19 Công-Trình Lê

Recently, the conditional SAGE certificate has been proposed as a sufficient condition for signomial positivity over a convex set. In this article, we show that the conditional SAGE certificate is $\textit{complete}$. That is, for any…

Optimization and Control · Mathematics 2020-10-27 Allen Houze Wang , Priyank Jaini , Yaoliang Yu , Pascal Poupart

Given a real projective curve with homogeneous coordinate ring R and a nonnegative homogeneous element f in R, we bound the degree of a nonzero homogeneous sum-of-squares g in R such that the product fg is again a sum of squares. Better…

Algebraic Geometry · Mathematics 2019-09-13 Grigoriy Blekherman , Gregory G. Smith , Mauricio Velasco

In the convergence analysis of numerical methods for solving partial differential equations (such as finite element methods) one arrives at certain generalized eigenvalue problems, whose maximal eigenvalues need to be estimated as…

Symbolic Computation · Computer Science 2016-06-21 Christoph Koutschan , Martin Neumüller , Cristian-Silviu Radu

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…

Algebraic Geometry · Mathematics 2023-06-14 Santiago Laplagne , Marcelo Valdettaro

The finite-degree Zariski (Z-) closure is a classical algebraic object, that has found a key place in several applications of the polynomial method in combinatorics. In this work, we characterize the finite-degree Z-closures of a subclass…

Combinatorics · Mathematics 2021-11-11 Srikanth Srinivasan , S. Venkitesh

Let $\mu(t) = \sum_{\tau\in S} \alpha_\tau \delta(t-\tau)$ denote an $|S|$-atomic measure defined on $[0,1]$, satisfying $\min_{\tau\neq \tau'}|\tau - \tau'|\geq |S|\cdot n^{-1}$. Let $\eta(\theta) = \sum_{\tau\in S} a_\tau D_n(\theta -…

Numerical Analysis · Mathematics 2020-01-07 Augustin Cosse

Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult to determine whether one is contained in the other. To address this issue we propose a new matrix Positivstellensatz that…

Optimization and Control · Mathematics 2020-05-06 Igor Klep , Jiawang Nie

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

Optimization and Control · Mathematics 2012-11-15 Mehdi Ghasemi , Murray Marshall

Consider the closed convex hull $K$ of a monomial curve given parametrically as $(t^{m_1},\ldots,t^{m_n})$, with the parameter $t$ varying in an interval $I$. We show, using constructive arguments, that $K$ admits a lifted semidefinite…

Optimization and Control · Mathematics 2023-03-08 Gennadiy Averkov , Claus Scheiderer

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

alg-geom · Mathematics 2008-02-03 Martin Sombra

In recent years, much work has been devoted to a systematic study of polynomial identities certifying strict or non-strict positivity of a polynomial on a basic closed semialgebraic set. The interest in such identities originates not least…

Commutative Algebra · Mathematics 2009-05-27 Sabine Burgdorf , Claus Scheiderer , Markus Schweighofer

In this paper we show that Sum-of-Squares optimization can be used to find optimal semialgebraic representations of sets. These sets may be explicitly defined, as in the case of discrete points or unions of sets; or implicitly defined, as…

Optimization and Control · Mathematics 2018-09-28 Morgan Jones , Matthew M. Peet

We generalize the notion of and results on maximal proper quadratic modules from commutative unital rings to $\ast$-rings and discuss the relation of this generalization to recent developments in noncommutative real algebraic geometry. The…

Rings and Algebras · Mathematics 2008-08-01 Jaka Cimpric

We study a particular class of representations from the fundamental groups of punctured spheres $\Sigma_{0,n}$ to the group $\text{PSL} (2,\mathbb R)$ (and their moduli spaces), that we call \emph{super-maximal}. Super-maximal…

Geometric Topology · Mathematics 2016-04-04 Bertrand Deroin , Nicolas Tholozan

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

Optimization and Control · Mathematics 2017-12-06 Hamza Fawzi , Mohab Safey El Din

We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…

Algebraic Geometry · Mathematics 2007-05-23 Jean B. Lasserre

Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums…

Data Structures and Algorithms · Computer Science 2018-02-28 Mareike Dressler , Adam Kurpisz , Timo de Wolff