Related papers: On Matrix Polynomials with Real Roots
We consider the sequence of polynomials $W_n(x)$ defined by the recursion $W_n(x)=(ax+b)W_{n-1}(x)+dW_{n-2}(x)$, with initial values $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a,b,d,t,r$ are real numbers, $a,t>0$, and $d<0$. We show that every…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
We determine the conditions for the existence of $C^p$-roots of curves of monic complex polynomials as well as for the existence of $C^p$-eigenvalues and $C^p$-eigenvectors of curves of normal complex matrices.
Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…
There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…
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…
The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
Analysing the cubic sectors of a real polynomial of degree n, a modification of the Newton Rule is Signs is proposed with which stricter upper bound on the number of real roots can be found. A new necessary condition for reality of the…
The strong spectral order induces a natural partial ordering on the manifold $H_{n}$ of monic hyperbolic polynomials of degree $n$. We prove that twisted root maps associated with linear operators acting on $H_{n}$ are G\aa rding convex on…
It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…
We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.
Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…
We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.
We present an improved form of the algorithm for constructing Jacobi rotations. This is simultaneously a more accurate code for finding the eigenvalues and eigenvectors of a real symmetric 2x2 matrix.
We study the convergence properties of a pair of learning algorithms (learning with and without memory). This leads us to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the…