English
Related papers

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

200 papers

In 1995, Reznick showed an important variant of the obvious fact that any positive semidefinite (real) quadratic form is a sum of squares of linear forms: If a form (of arbitrary even degree) is positive definite then it becomes a sum of…

Algebraic Geometry · Mathematics 2023-10-20 Markus Schweighofer , Luis Felipe Vargas

In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…

Optimization and Control · Mathematics 2018-09-25 María López Quijorna

A non-negativity certificate (NNC) is a way to write a polynomial so that its non-negativity on a semialgebraic set becomes evident. Positivstellens\"atze (Ps\"atze) guarantee the existence of NNCs. Both, NNCs and Ps\"atze underlie powerful…

Optimization and Control · Mathematics 2024-03-25 Olga Kuryatnikova , Juan C. Vera , Luis F. Zuluaga

In characteristic zero, the Bernstein-Sato polynomial of a hypersurface can be described as the minimal polynomial of the action of an Euler operator on a suitable D-module. We consider the analogous D-module in positive characteristic, and…

Algebraic Geometry · Mathematics 2008-08-17 Mircea Mustata

In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…

Combinatorics · Mathematics 2021-01-19 Karim Adiprasito , Raman Sanyal

In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite programming formulations, or as more recently proposed by Papp and…

Optimization and Control · Mathematics 2022-06-14 Lea Kapelevich , Chris Coey , Juan Pablo Vielma

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

Algebraic Geometry · Mathematics 2024-01-02 Hoon Hong , Brittany Riggs

Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of $|f(A,B)|$ for finite subsets $A$, $B$ of a field, and polynomial $f(x,y)$ of the form $f(x,y)=g(x)+yh(x)$, where degree of $g$ is greater then degree…

Combinatorics · Mathematics 2013-09-17 Fedor Petrov

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…

Algebraic Geometry · Mathematics 2017-08-10 Công-Trình Lê , Thi-Hoa-Binh Du

We consider the problem of computing the minimum value $f_{\min,K}$ of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$, which can be reformulated as finding a probability measure $\nu$ on $K$ minimizing $\int_K f d\nu$.…

Optimization and Control · Mathematics 2020-01-31 Lucas Slot , Monique Laurent

Building upon recent work by the author, we prove that multivariate integration in the following subspace of the Wiener algebra over $[0,1)^d$ is strongly polynomially tractable: \[ F_d:=\left\{ f\in C([0,1)^d)\:\middle| \:…

Numerical Analysis · Mathematics 2023-06-05 Takashi Goda

It is well known that a strictly convex minimand admits at most one minimizer. We prove a partial converse: Let $X$ be a locally convex Hausdorff space and $f \colon X \mapsto \left( - \infty , \infty \right]$ a function with compact…

Optimization and Control · Mathematics 2023-03-23 Thomas Ruf , Bernd Schmidt

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

Algebraic Geometry · Mathematics 2010-03-25 Claus Scheiderer

We consider the class of standard weighted Bergman spaces $A^2_{\alpha}(\mathbb{D})$ and the set $SF^N(\mathbb{T})$ of simple partial fractions of degree $N$ with poles on the unit circle. We prove that under certain conditions, the simple…

Complex Variables · Mathematics 2025-06-04 Nikiforos Biehler

We present an expanded expository account of the $K$-moment problem for polynomial algebras over \(\R^d\), with special emphasis on compact basic closed semialgebraic sets. The central question is to characterize those linear functionals on…

Functional Analysis · Mathematics 2026-04-15 Malik Amir

We show that the maximal shifts in the minimal free resolution of the quotients of a polynomial ring by a monomial ideal are subadditive as a function of the homological degree. This answers a question that has received some attention in…

Commutative Algebra · Mathematics 2024-05-03 Karim Adiprasito , Anders Björner , Joel Hakavuori , Minas Margaritis , Volkmar Welker

In this paper we develop a number of results and notions concerning Positivstellens\"atze for semirings (preprimes) of commutative unital real algebras. First we reduce the Archimedean Positivstellensatz for semirings to the corresponding…

Algebraic Geometry · Mathematics 2022-07-07 Konrad Schmüdgen , Matthias Schötz

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

Number Theory · Mathematics 2017-03-10 Shuntaro Yamagishi

In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…

Mathematical Physics · Physics 2007-05-23 V. Sunilkumar

Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…

Computational Complexity · Computer Science 2015-02-24 Yash Deshpande , Andrea Montanari