Related papers: On the Real Multidimensional Rational K-Moment Pro…

Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…

Let K be a field, let R=K[x_1,..., x_m] be a polynomial ring with the standard Z^m-grading (multigrading), let L be a Noetherian multigraded R-module, and let F: E --> G be a finite free multigraded presentation of L over R. Given a choice…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

We consider the linear conic optimization problem with the cone of nonnegative polynomials. Its dual optimization problem is the generalized moment problem. Moment-SOS relaxations are powerful for solving them. This paper studies finite…

In this paper we give a complete solution of the following "polynomial moment problem" which arose about 10 years ago in connection with Poincare's center-focus problem. For a given polynomial P(z) to describe polynomials Q(z) orthogonal to…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We consider the quadratic optimization problem $\max_{x \in C}\ x^T Q x + q^T x$, where $C\subseteq\mathbb{R}^n$ is a box and $r := \mathrm{rank}(Q)$ is assumed to be $\mathcal{O}(1)$ (i.e., fixed). We show that this case can be solved in…

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

This paper proposes a real moment-HSOS hierarchy for complex polynomial optimization problems with real coefficients. We show that this hierarchy provides the same sequence of lower bounds as the complex analogue, yet is much cheaper to…

A polynomial that is a sum of squares (SOS) of other polynomials is evidently positive. The converse is not true, there are positive polynomials which are not SOS. This note focuses on the problem of certifying, in exact arithmetic, that a…

For $1\le t < \infty$, a compact subset $K\subset\mathbb C$, and a finite positive measure $\mu$ supported on $K$, $R^t(K, \mu)$ denotes the closure in $L^t(\mu)$ of rational functions with poles off $K$. Let $\text{abpe}(R^t(K, \mu))$…

This paper studies Nash equilibrium problems that are given by polynomial functions. We formulate efficient polynomial optimization problems for computing Nash equilibria. The Lasserre type Moment-SOS relaxations are used to solve them.…

Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…

Let $\mathbb K$ be an algebraically closed field of characteristic zero, $\mathbb K[X]$ the polynomial ring in $n$ variables. The vector space $T_n = \mathbb K[X]$ is a $\mathbb K[X]$-module with the action $x_i \cdot v = v_{x_i}'$ for $v…

Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…

Let $A$ and $B$ be non-constant rational functions over $\mathbb{C}$, and let $K \subset \mathbb{P}^1(\mathbb{C})$ be an infinite set. Using height functions, we prove that the inclusion $ A^{-1}(K) \subseteq B^{-1}(K) $ implies the…

This paper builds and extends on the authors' previous work related to the algorithmic tool, Cylindrical Algebraic Decomposition (CAD), and one of its core applications, Real Quantifier Elimination (QE). These topics are at the heart of…

Let $r$ be a nonconstant noncommutative rational function in $m$ variables over an algebraically closed field $K$ of characteristic 0. We show that for $n$ large enough, there exists an $X\in M_n(K)^m$ such that $r(X)$ has $n$ distinct and…

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is a tool for solving polynomial quantified entailments in…