Related papers: On Matrix Polynomials with Real Roots
In this note, we consider arbitrary finite-dimensional real algebras containing a copy of complex numbers. It is proved that matrices with entries from an arbitrary finite-dimensional real algebra containing a square root of negative one in…
Theory of motivic superpolynomials is developed, including its extension to algebraic links colored by rows, relations to $L$-functions of plane curve singularities, the justification of the motivic versions of Weak Riemann Hypothesis, and…
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. Hyperbolic polynomials give rise to a class of (hyperbolic) matroids which properly contains the class of…
As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side…
Lehmer constructs four classes of matrices constructed from roots of unity for which the characteristic polynomials and the $k$-th powers can be determined explicitly. Here we study a class of matrices which arise naturally in…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…
We show that the roots of any smooth curve of polynomials with only real roots can be parametrized twice differentiably (but not better).
We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.
A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…
We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…
Character expansion expresses extended HOMFLY polynomials through traces of products of finite dimensional R- and Racah mixing matrices. We conjecture that the mixing matrices are expressed entirely in terms of the eigenvalues of the…
We study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles. In particular, we prove that polynomial eigenvalue problems defined by matrices with Gaussian entries…
We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…
This survey revolves around the question how the roots of a monic polynomial (resp. the spectral decomposition of a linear operator), whose coefficients depend in a smooth way on parameters, depend on those parameters. The parameter…