Related papers: Real Zero Polynomials and A. Horn's Problem

We consider the problem of simultaneous direct sum decomposition of a set of multivariate polynomials. To this end, we extend Harrison's center theory for a single homogeneous polynomial to this broader setting. It is shown that the center…

In this paper we factorize matrix polynomials into a complete set of spectral factors using a new design algorithm and we provide a complete set of block roots (solvents). The procedure is an extension of the (scalar) Horner method for the…

We propose in this work a subgradient extragradient method with inertial and correction terms for solving equilibrium problems in a real Hilbert space. We obtain that the sequence generated by our proposed method converges weakly to a point…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

We study real bihomogeneous polynomials $r(z,\bar{z})$ in $n$ complex variables for which $r(z,\bar{z}) \|z\|^2$ is the squared norm of a holomorphic polynomial mapping. Such polynomials are the focus of the Sum of Squares Conjecture, which…

This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…

Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…

In this paper, a sequence of linear combination of $R_{I}$ type polynomials such that the terms in this sequence have a common zero is constructed. A biorthogonality relation arising from such a sequence is discussed. Besides a sequence of…

This paper provides the spectral decomposition of $(\star,\epsilon)$-palindromic quadratic matrix polynomial $P(\lambda)$ by a standard pair and a parameter matrix. When $J$ is assumed to be a block diagonal matrix, the parameter matrix…

An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.

Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

The forcing number of a graph with a perfect matching $M$ is the minimum number of edges in $M$ whose endpoints need to be deleted, such that the remaining graph only has a single perfect matching. This number is of great interest in…

In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate…

Two classical theorems in matrix theory, due to Schur and Horn, relate the eigenvalues of a self-adjoint matrix to the diagonal entries. These have recently been given a formulation in the setting of operator algebras as the Schur-Horn…

We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…

Two-view triangulation is a problem of minimizing a quadratic polynomial under an equality constraint. We derive a polynomial that encodes the local minimizers of this problem using the theory of Lagrange multipliers. This offers a simpler…

Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected…

We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…

We show that for a given set $\Lambda$ of $nk$ distinct real numbers $\lambda_1, \lambda_2, \ldots, \lambda_{nk}$ and $k$ graphs on $n$ nodes, $G_0, G_1,\ldots,G_{k-1}$, there are real symmetric $n\times n$ matrices $A_s$, $s=0,1,\ldots,…