Related papers: On Matrix Polynomials with Real Roots

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Let $\nu_0(t),\nu_1(t),\,\ldots\,,\nu_n(t)$ be the roots of the equation $R(z)=t$, where $R(z)$ is a rational function of the form \[R(z)=z+\sum\limits_{k=1}^n\frac{\alpha_k}{z-\mu_k},\] $\mu_k$ are pairwise different real numbers,…

We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

This brief note corrects some errors in the paper quoted in the title, highlights a combinatorial result which may have been overlooked, and points to further improvements in recent literature.

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

An outstanding conjecture on roots of Ehrhart polynomials says that all roots $\alpha$ of the Ehrhart polynomial of an integral convex polytope of dimension $d$ satisfy $-d \leq \Re(\alpha) \leq d-1$. In this paper, we suggest some…

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

A polynomial is real-rooted if all of its roots are real. For every polynomial $f(t) \in {\mathbf R}[t]$, the Hermite-Sylvester theorem associates a quadratic form $\Phi_2$ such that $f(t)$ is real-rooted if and only if $\Phi_2$ is positive…

The fact that a real univariate polynomial misses some real roots is usually overcame by considering complex roots, but the price to pay for, is a complete lost of the sign structure that a set of real roots is endowed with (mutual position…

With this article, we hope to launch the investigation of what we call the real zero amalgamation problem. Whenever a polynomial arises from another polynomial by substituting zero for some of its variables, we call the second polynomial an…

We show that various old and new bounds involving eigenvalues of a complex n x n matrix are immediate consequences of the inequalities involving variance of real and complex numbers.

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

In parameter slices of quadratic rational functions, we identify arcs represented by matings of quadratic polynomials. These arcs are on the boundaries of hyperbolic components.

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…