English
Related papers

Related papers: Representation of nonnegative convex polynomials

200 papers

We give an extension to a nonconvex setting of the classical radial representation result for lower semicontinuous envelope of a convex function on the boundary of its effective domain. We introduce the concept of radial uniform upper…

Classical Analysis and ODEs · Mathematics 2013-09-18 Omar Anza Hafsa , Jean-Philippe Mandallena

In this article we develop new methods for exhibiting convex semialgebraic sets that are not spectrahedral shadows. We characterize when the set of nonnegative polynomials with a given support is a spectrahedral shadow in terms of sums of…

Rings and Algebras · Mathematics 2024-07-22 Manuel Bodirsky , Mario Kummer , Andreas Thom

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…

Metric Geometry · Mathematics 2007-09-14 Gennadiy Averkov , Martin Henk

Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is,…

Optimization and Control · Mathematics 2011-01-31 Didier Henrion

We begin a systematic study of positivity and moment problems in an equivariant setting. Given a reductive group $G$ over $\R$ acting on an affine $\R$-variety $V$, we consider the induced dual action on the coordinate ring $\R[V]$ and on…

Algebraic Geometry · Mathematics 2013-01-07 Jaka Cimpric , Salma Kuhlmann , Claus Scheiderer

Given a collection P of k^2 commutative polynomials in 2k^2 commutative variables, the objective is to find a condensed representation of these polynomials in terms of a single non-commutative polynomial p(X,Y) in two k x k matrix variables…

Rings and Algebras · Mathematics 2012-12-06 Harry Dym , J. W. Helton , Caleb Meier

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Optimization and Control · Mathematics 2021-05-12 Amir Ali Ahmadi , Cemil Dibek , Georgina Hall

We consider the tensor product of modules over the polynomial algebra corresponding to the usual tensor product of linear operators. We present a general description of the representation ring in case the ground field k is perfect. It is…

Representation Theory · Mathematics 2009-07-09 Erik Darpö , Martin Herschend

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Combinatorics · Mathematics 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

We consider polynomials expressing the cohomology classes of subvarieties of products of projective spaces, and limits of positive real multiples of such polynomials. We study the relation between these covolume polynomials and Lorentzian…

Algebraic Geometry · Mathematics 2025-04-02 Paolo Aluffi

We study a properly convex real projective manifold with (possibly empty) compact, strictly convex boundary, and which consists of a compact part plus finitely many convex ends. We extend a theorem of Koszul which asserts that for a compact…

Geometric Topology · Mathematics 2018-03-28 Daryl Cooper , Darren Long , Stephan Tillmann

Let $K$ be a compact subset of a totally-real manifold $M$, where $M$ is either a $\mathcal{C}^2$-smooth graph in $\mathbb{C}^{2n}$ over $\mathbb{C}^n$, or $M=u^{-1}\{0\}$ for a $\mathcal{C}^2$-smooth submersion $u$ from $\mathbb{C}^n$ to…

Complex Variables · Mathematics 2015-04-28 Sushil Gorai

Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument. We provide an explicit example of a convex form of degree four in…

Optimization and Control · Mathematics 2022-08-23 James Saunderson

We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…

Combinatorics · Mathematics 2023-04-05 Niklas Kochdumper , Matthias Althoff

For a semialgebraic set K in R^n, let P_d(K) be the cone of polynomials in R^n of degrees at most d that are nonnegative on K. This paper studies the geometry of its boundary. When K=R^n and d is even, we show that its boundary lies on the…

Optimization and Control · Mathematics 2010-04-26 Jiawang Nie

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 paper, various polynomial representations of strange classical Lie superalgebras are investigated. It turns out that the representations for the algebras of type P are indecomposable, and we obtain the composition series of the…

Representation Theory · Mathematics 2010-01-21 Cuiling Luo

A SONC polynomial is a sum of finitely many non-negative circuit polynomials, whereas a non-negative circuit polynomial is a non-negative polynomial whose support is a simplicial circuit. We show that there exist non-negative polynomials…

Optimization and Control · Mathematics 2021-08-05 Gennadiy Averkov

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

Optimization and Control · Mathematics 2008-09-22 Didier Henrion

By a result of Helton and McCullough, open bounded convex free semialgebraic sets are exactly open (matricial) solution sets D_L of a linear matrix inequality (LMI) L(X)>0. This paper gives a precise algebraic certificate for a polynomial…

Functional Analysis · Mathematics 2018-04-27 J. William Helton , Igor Klep , Christopher S. Nelson