English
Related papers

Related papers: A Positivstellensatz for Conditional SAGE Signomia…

200 papers

We analyse the representation of positive polynomials in terms of Sums of Squares. We provide a quantitative version of Putinar's Positivstellensatz over a compact basic semialgebraic set S, with a new polynomial bound on the degree of the…

Commutative Algebra · Mathematics 2023-02-07 Lorenzo Baldi , Bernard Mourrain

We introduce and study a cone which consists of a class of generalized polynomial functions and which provides a common framework for recent non-negativity certificates of polynomials in sparse settings. Specifically, this…

Algebraic Geometry · Mathematics 2020-09-22 Lukas Katthän , Helen Naumann , Thorsten Theobald

Let $X\subset\mathbb{R}^n$ be a convex closed and semialgebraic set and let $f$ be a polynomial positive on $X$. We prove that there exists an exponent $N\geq 1$, such that for any $\xi\in\mathbb{R}^n$ the function…

Algebraic Geometry · Mathematics 2018-12-13 Krzysztof Kurdyka , Katarzyna Kuta , Stanisław Spodzieja

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 recent years, techniques based on convex optimization and real algebra that produce converging hierarchies of lower bounds for polynomial minimization problems have gained much popularity. At their heart, these hierarchies rely crucially…

Optimization and Control · Mathematics 2018-08-28 Amir Ali Ahmadi , Georgina Hall

A new scheme for proving pseudoidentities from a given set {\Sigma} of pseudoidentities, which is clearly sound, is also shown to be complete in many instances, such as when {\Sigma} defines a locally finite variety, a pseudovariety of…

Group Theory · Mathematics 2019-03-18 Jorge Almeida , Ondřej Klíma

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…

Symbolic Computation · Computer Science 2018-09-06 Hoon Hong , Thomas Sturm

Let $g_1,\dots, g_s \in \mathbb{R}[X_1,\dots, X_n,Y]$ and $S = \{(\bar{x},y)\in \mathbb{R}^{n+1} \mid g_1(\bar{x},y) \ge 0, \dots, g_s(\bar{x}, y) \ge 0\}$ be a non-empty, possibly unbounded, subset of a cylinder in $\mathbb{R}^{n+1}$. Let…

Algebraic Geometry · Mathematics 2024-01-09 Gabriela Jeronimo , Daniel Perrucci

Exposed positive maps in matrix algebras define a dense subset of extremal maps. We provide a sufficient condition for a positive map to be exposed. This is an analog of a spanning property which guaranties that a positive map is optimal.…

Quantum Physics · Physics 2012-03-05 Dariusz Chruściński , Gniewomir Sarbicki

Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials, via the definition of convexity, its first order characterization, and its second order…

Optimization and Control · Mathematics 2013-12-31 Amir Ali Ahmadi , Pablo A. Parrilo

Many key quantities in statistics and probability theory such as the expectation, quantiles, expectiles and many risk measures are law-determined maps from a space of random variables to the reals. We call such a law-determined map, which…

Probability · Mathematics 2026-04-08 Tobias Fissler , Ilya Molchanov

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

In this note we prove the complex counterpart of the S-inequality for complete Reinhardt sets. In particular, this result implies that the complex S-inequality holds for unconditional convex sets.

Probability · Mathematics 2013-09-20 Piotr Nayar , Tomasz Tkocz

For smooth bounded pseudoconvex domains in $mathbb{C}^{2}$, we provide geometric conditions on (the points of infinite type in) the boundary which imply compactness of the $\bar{\partial}$-Neumann operator. It is noteworthy that the proof…

Complex Variables · Mathematics 2007-05-23 Emil J. Straube

Let $S =\{x\in \re^n: g_1(x)\geq 0, ..., g_m(x)\geq 0\}$ be a semialgebraic set defined by multivariate polynomials $g_i(x)$. Assume $S$ is convex, compact and has nonempty interior. Let $S_i =\{x\in \re^n: g_i(x)\geq 0\}$, and $\bdS$…

Optimization and Control · Mathematics 2008-07-21 J. William Helton , Jiawang Nie

In this paper, we provide an equivalent condition for the Chvatal-Gomory (CG) closure of a closed convex set to be finitely-generated. Using this result, we are able to prove that, for any closed convex set that can be written as the…

Optimization and Control · Mathematics 2021-06-02 Haoran Zhu

We consider convergence sets of formal power series of the form $f(z,t)=\sum_{n=0}^{\infty} f_n(z)t^n$, where $f_n(z)$ are holomorphic functions on a domain $\Omega$ in $\mathbb{C}$. A subset $E$ of $\Omega$ is said to be a convergence set…

Complex Variables · Mathematics 2017-07-14 Basma Al-Shutnawi , Hua Liu , Daowei Ma

We consider linear recurrences with polynomial coefficients of Poincar\'e type and with a unique simple dominant eigenvalue. We give an algorithm that proves or disproves positivity of solutions provided the initial conditions satisfy a…

Symbolic Computation · Computer Science 2024-01-18 Alaa Ibrahim , Bruno Salvy

Strassen's Positivstellensatz is a powerful but little known theorem on preordered commutative semirings satisfying a boundedness condition similar to Archimedeanicity. It characterizes the relaxed preorder induced by all monotone…

Algebraic Geometry · Mathematics 2021-02-03 Tobias Fritz

We consider certificates of positivity for univariate polynomials with rational coefficients that are positive over (an interval of)~$\mathbb{R}$. Such certificates take the form of weighted sums of squares (SOS) of polynomials with…

Computational Complexity · Computer Science 2025-12-30 Matías Bender , Philipp Di Dio , Elias Tsigaridas