Related papers: Parametrized systems of generalized polynomial equ…
This paper is devoted to the stability analysis of spatially interconnected systems (SISs) via the sum-of-squares (SOS) decomposition of positive trigonometric polynomials. For each spatial direction of SISs, three types of interconnected…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…
This work reports and classifies the most general construction of rational quantum potentials in terms of the generalized Hermite polynomials. This is achieved by exploiting the intrinsic relation between third-order shape-invariant…
For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…
The generalized Henon-Heiles system with an additional nonpolynomial term is considered. In two nonintegrable cases new two-parameter solutions have been obtained in terms of elliptic functions. These solutions generalize the known…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…
It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…
This work considers polynomial optimization problems where the objective admits a low-rank canonical polyadic tensor decomposition. We introduce LRPOP (low-rank polynomial optimization), a new hierarchy of semidefinite programming…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
Let $\cp:=(P_1,...,P_s)$ be a given family of $n$-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by $d$ and $h$, respectively. Suppose furthermore that for…
Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…
Planar holomorphic systems $\dot{x}=u(x,y)$, $\dot{y}=v(x,y)$ are those that $u=\operatorname{Re}(f)$ and $v=\operatorname{Im}(f)$ for some holomorphic function $f(z)$. They have important dynamical properties, highlighting, for example,…
The main theme of the article is the study of discrete systems of material points subjected to constraints not only of a geometric type (holonomic constraints) but also of a kinematic type (nonholonomic constraints). The setting up of the…
We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees were much larger, e.g., 248832 (for just the non-degenerate roots)…
Using an algebraic method for solving the wave equation in quantum mechanics, we encountered a new class of orthogonal polynomials on the real line. It consists of a four-parameter polynomial with continuous spectrum on the whole real line…
We investigate the asymptotic behavior of a family of multiple orthogonal polynomials that is naturally linked with the normal matrix model with a monomial potential of arbitrary degree $d+1$. The polynomials that we investigate are…