Related papers: Deciding Nonnegativity of Polynomials by MAPLE

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$…

The classical Descartes' rule of signs limits the number of positive roots of a real polynomial in one variable by the number of sign changes in the sequence of its coefficients. One can ask the question which pairs of nonnegative integers…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

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…

In further pursuit of a solution to the celebrated nonnegative inverse eigenvalue problem, Loewy and London [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90] posed the problem of characterizing all polynomials that preserve all…

By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…

Final coalgebras as "categorical greatest fixed points" play a central role in the theory of coalgebras. Somewhat analogously, most proof methods studied therein have focused on greatest fixed-point properties like safety and bisimilarity.…

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

The article focuses on three different notions of polynomiality for maps of modules. In addition to the polynomial maps studied by Eilenberg and Mac Lane and the strict polynomial maps ("lois polynomes") considered by Roby, we introduce…

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

Deep Neural Networks (DNNs) have obtained impressive performance across tasks, however they still remain as black boxes, e.g., hard to theoretically analyze. At the same time, Polynomial Networks (PNs) have emerged as an alternative method…

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

These lecture notes provide an informal introduction to the theory of nonnegative polynomials and sums of squares. We highlight the history and some recent developments, especially the new connections with classical (complex) algebraic…

Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…

This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…

We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…