中文
相关论文

相关论文: Degree bound of P\'olya Positivstellenstaz

200 篇论文

Following de Loera and Santos, the P\'olya exponent of a $n$-ary real form (i.e. a homogeneous polynomial in $n$ variables with real coefficients) $f$ is the infimum of the upward closed set of nonnegative integers $m$ such that $(x_1 +…

代数几何 · 数学 2024-11-04 Colin Tan

Let $p$ be a nonconstant form in $\mathbb{R}[x_1,\dots,x_n]$ with $p(1,\dots,1)>0$. If $p^m$ has strictly positive coefficients for some integer $m\ge1$, we show that $p^m$ has strictly positive coefficients for all sufficiently large $m$.…

代数几何 · 数学 2017-04-11 Claus Scheiderer , Colin Tan

We provide a new degree bound on the weighted sum-of-squares (SOS) polynomials for Putinar-Vasilescu's Positivstellensatz. This leads to another Positivstellensatz saying that if $f$ is a polynomial of degree at most $2 d_f$ nonnegative on…

最优化与控制 · 数学 2021-05-28 Ngoc Hoang Anh Mai , Victor Magron

The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…

组合数学 · 数学 2022-09-14 Guy Moshkovitz , Jeffery Yu

Putinar's Positivstellensatz is a central theorem in real algebraic geometry. It states the following: If you have a set $S= \{ x \in R^n \ | \ g_1 (x) \geq 0, ... , g_m(x) \geq 0\}$ described by some real polynomials $g_i$, then every real…

代数几何 · 数学 2016-03-23 Tom-Lukas Kriel

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

数学物理 · 物理学 2007-07-06 Christopher J. Hillar , Charles R. Johnson

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

最优化与控制 · 数学 2024-12-19 Etienne de Klerk , Juan Vera Lizcano

Let $P(x)$ be a polynomial of degree $m$, with nonnegative and non-decreasing coefficients. We settle the conjecture that for any positive real number $d$, the coefficients of $P(x+d)$ form a unimodal sequence, of which the special case $d$…

组合数学 · 数学 2008-09-10 Yi Wang , Yeong-Nan Yeh

We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get…

代数几何 · 数学 2008-12-16 Jiawang Nie , Markus Schweighofer

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

经典分析与常微分方程 · 数学 2016-11-30 Zhong Guan , Tao Wang

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…

交换代数 · 数学 2023-02-07 Lorenzo Baldi , Bernard Mourrain

We prove that there is an absolute constant $c > 0$ such that for every $$a_0,a_1, \ldots,a_n \in [1,M]\,, \qquad 1 \leq M \leq \frac 14 \exp \left( \frac n9 \right)\,,$$ there are $$b_0,b_1,\ldots,b_n \in \{-1,0,1\}$$ such that the…

数论 · 数学 2024-10-17 Tamás Erdélyi

Let $f$ be a monic univariate polynomial. We say that $f$ is positive if $f(x)$ is positive over all $x > 0$. If all the coefficients of $f$ are non-negative, then $f$ is trivially positive. In 1883, Poincar\'e proved that $f$ is positive…

代数几何 · 数学 2025-09-12 Brittany Riggs

This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…

最优化与控制 · 数学 2024-12-30 Lei Huang

We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…

最优化与控制 · 数学 2014-08-19 Zhao Sun

Let $p_{\min}$ denote the minimum of a polynomial $p$ over a (general) compact semialgebraic set $S \subseteq \mathbb{R}^n$. A standard way to approximate $p_{\min}$ is via hierarchies built from Positivstellens\"atze, which certify…

最优化与控制 · 数学 2026-05-21 Olga Heijmans-Kuryatnikova , Juan C. Vera , Luis F. Zuluaga

Let $\Omega\subset\mathbb{R}^n$ be a bounded Lipschitz domain. For any $\epsilon\in (0,1)$ we show that for any Dirichlet eigenvalue $\lambda_k(\Omega)>\Lambda(\epsilon,\Omega)$, it holds \begin{align*} k&\le…

谱理论 · 数学 2026-05-28 Renjin Jiang , Fanghua Lin

In this paper we give a matrix version of Handelman's Positivstellensatz [1], representing polynomial matrices which are positive definite on convex, compact polyhedra. Moreover, we propose also a procedure to find such a representation. As…

代数几何 · 数学 2017-08-10 Công-Trình Lê , Thi-Hoa-Binh Du

Let $L$ be a linear differential operator with constant coefficients of order $n$ and complex eigenvalues $\lambda_{0},...,\lambda_{n}$. Assume that the set $U_{n}$ of all solutions of the equation $Lf=0$ is closed under complex…

经典分析与常微分方程 · 数学 2010-09-24 J. M. Aldaz , O. Kounchev , H. Render

We prove a Positivstellensatz for operator-valued noncommutative polynomials that are positive on matrix convex sets. Specifically, let $p$ be an operator-valued polynomial in $B(H)\otimes C<x>$ of degree at most $2d+1$, where $H$ is…

泛函分析 · 数学 2026-05-01 Abhay Jindal , Igor Klep , Scott McCullough
‹ 上一页 1 2 3 10 下一页 ›