Related papers: Reducing non-negativity over general semialgebraic…

The paper is concerned with various types of noncommutative Positivstellens\"atze for the matrix algebra $M_n(\cA)$, where $\cA$ is an algebra of operators acting on a unitary space, a path algebra, a cyclic algebra or a formally real…

The prevalence of neural networks in society is expanding at an increasing rate. It is becoming clear that providing robust guarantees on systems that use neural networks is very important, especially in safety-critical applications. A…

We show that Connes' embedding conjecture on von Neumann algebras is equivalent to the existence of certain algebraic certificates for a polynomial in noncommuting variables to satisfy the following nonnegativity condition: The trace is…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

We study a class of signomials whose positive support is the set of vertices of a simplex and which may have several negative support points in the simplex. Various groups of authors have provided an exact characterization for the global…

Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…

Preordered semialgebras and semirings are two kinds of algebraic structures occurring in real algebraic geometry frequently and usually play important roles therein. They have many interesting and promising applications in the fields of…

Robustness certification against bounded input noise or adversarial perturbations is increasingly important for deployment recurrent neural networks (RNNs) in safety-critical control applications. To address this challenge, we present…

Using only global image-class labels, weakly-supervised learning methods, such as class activation mapping, allow training CNNs to jointly classify an image, and locate regions of interest associated with the predicted class. However,…

In Heintz-Schnorr (1982), the authors introduced the notion of correct test sequence and since then it has been widely used to design probabilistic algorithms for Polynomial Equality Test. The aim of this manuscript is to study the…

There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple's library RegularChains since Maple 13. By using the functions of the library, e.g., RealRootClassfication, one can prove and discover…

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…

Subspace sparse coding (SSC) algorithms have proven to be beneficial to clustering problems. They provide an alternative data representation in which the underlying structure of the clusters can be better captured. However, most of the…

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

We consider the problem of minimizing a polynomial $f$ over the binary hypercube. We show that, for a specific set of polynomials, their binary non-negativity can be checked in a polynomial time via minimum cut algorithms, and we construct…

We consider linear recurrences with polynomial coefficients of Poincar\'e type and with a unique simple dominant eigenvalue. We give an algorithm that proves or disproves positivity of solutions provided the initial conditions satisfy a…

Recently a moment-sum-of-squares hierarchy for exit location estimation of stochastic processes has been presented. When restricting to the special case of the unit ball, we show that the solutions approach the optimal value by a…

Schm\"udgen's Theorem says that if a basic closed semialgebraic set K = {g_1 \geq 0, ..., g_s \geq 0} in R^n is compact, then any polynomial f which is strictly positive on K is in the preordering generated by the g_i's. Putinar's Theorem…

NLCertify is a software package for handling formal certification of nonlinear inequalities involving transcendental multivariate functions. The tool exploits sparse semialgebraic optimization techniques with approximation methods for…

In recent years, much work has been devoted to a systematic study of polynomial identities certifying strict or non-strict positivity of a polynomial on a basic closed semialgebraic set. The interest in such identities originates not least…