English
Related papers

Related papers: Noncommutative polynomials nonnegative on a variet…

200 papers

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

We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…

Combinatorics · Mathematics 2024-08-06 Jonathan Leake , Nick Ryder

Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…

Rings and Algebras · Mathematics 2020-07-28 Alexei Kanel-Belov , Sergey Malev , Louis Rowen , Roman Yavich

We find a class of algebras A satisfying the following property: for every nontrivial noncommutative polynomial, the linear span of all its values in A equals A. This class includes the algebras of all bounded and all compact operators on…

Operator Algebras · Mathematics 2011-04-19 Matej Bresar , Igor Klep

An important theorem by Timofte states that nonnegativity of real $n$-variate symmetric polynomials of degree $d$ can be decided at test sets given by all points with at most $\lfloor\frac{d}{2}\rfloor$ distinct components. However, if the…

Algebraic Geometry · Mathematics 2013-03-19 Sadik Iliman , Timo de Wolff

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

Optimization and Control · Mathematics 2017-08-01 Jiawang Nie , Jinling Zhao

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…

Operator Algebras · Mathematics 2022-11-17 Mark Girard , Seung-Hyeok Kye , Erling Størmer

In the smallest cases where there exist nonnegative polynomials that are not sums of squares we present a complete explanation of this distinction. The fundamental reason that the cone of sums of squares is strictly contained in the cone of…

Algebraic Geometry · Mathematics 2012-02-09 Grigoriy Blekherman

We survey a few strengthenings and generalizations of the Combinatorial Nullstellensatz of Alon and the Schwartz-Zippel Lemma. These lemmas guarantee the existence of (a certain number of) nonzeros of a multivariate polynomial when the…

Combinatorics · Mathematics 2023-05-19 Günter Rote

Generalising the Heilman-Lieb Theorem from statistical physics, Chudnovsky and Seymour [J. Combin. Theory Ser. B, 97(3):350--357] showed that the univariate independence polynomial of any claw-free graph has all of its zeros on the negative…

Combinatorics · Mathematics 2026-02-09 Mark Jerrum , Viresh Patel

One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…

Logic · Mathematics 2011-07-01 David Monniaux , Pierre Corbineau

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 we construct a linear space that parameterizes all invariant bilinear forms on a given vertex algebra with values in a arbitrary vector space. Also we prove that every invariant bilinear form on a vertex algebra is symmetric.…

Quantum Algebra · Mathematics 2009-09-29 Michael Roitman

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

Numerical Analysis · Mathematics 2015-05-05 Vahagn Vardanyan

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

Every symmetric polynomial p(x)=p(x_1,...,x_g) (with real coefficients) in g noncommuting variables x_1, ..., x_g can be written as a sum and difference of squares of noncommutative polynomials. Let s(p), the negative signature of p, denote…

Functional Analysis · Mathematics 2009-03-12 Harry Dym , Jeremy M. Greene , J. William Helton , Scott A. McCullough

This article gives a class of Nullstellens\"atze for noncommutative polynomials. The singularity set of a noncommutative polynomial $f=f(x_1,\dots,x_g)$ is $Z(f)=(Z_n(f))_n$, where $Z_n(f)=\{X \in M_n^g: \det f(X) = 0\}.$ The first main…

Rings and Algebras · Mathematics 2022-05-16 J. William Helton , Igor Klep , Jurij Volčič

This article takes up the challenge of extending the classical Real Nullstellensatz of Dubois and Risler to left ideals in a *-algebra A. After introducing the notions of non-commutative zero sets and real ideals, we develop three themes…

Functional Analysis · Mathematics 2014-02-26 Jaka Cimpric , Bill Helton , Scott McCullough , Christopher Nelson

We characterize the canonical algebras such that for all dimension vectors of homogeneous modules the corresponding module varieties are complete intersections (respectively, normal). We also investigate the sets of common zeros of…

Representation Theory · Mathematics 2007-11-07 Grzegorz Bobinski

Linear matrix inequalities (LMIs) are ubiquitous in real algebraic geometry, semidefinite programming, control theory and signal processing. LMIs with (dimension free) matrix unknowns are central to the theories of completely positive maps…

Functional Analysis · Mathematics 2020-05-06 J. William Helton , Igor Klep , Scott McCullough , Jurij Volčič
‹ Prev 1 3 4 5 6 7 10 Next ›