The Laguerre polynomials preserve real-rootedness
The linear transformation that sends $x^n$ to the n'th Laguerre polynomial preserves real-rootedness.
arXiv subjects
Publications and source records attributed to Steve Fisk.
The linear transformation that sends $x^n$ to the n'th Laguerre polynomial preserves real-rootedness.
We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices, namely totally stable matrices and totally upper matrices.
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part covers polynomials in several variables that generalize polynomials with all real roots. We introduce generating functions and use them to establish properties of a linear transformation. We also consider matrices and matrix polynomials. The third part considers polynomials with complex roots. The two main classes considered are polynomials with all roots in the left half plane (stable polynomials) and those with all roots in the lower half plane (Upper half plane polynomials). These naturally generalize to polynomials in many variables. And, of course, there is much more.
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics in one variable such as Routh-Hurwitz, the Edge theorem, and Kharitonov theory.
The 600 cell S has exactly 10 5-colorings. From these colorings we can construct the space of colorings $B(S)$. This complex has 1344 colorings, and is isomorphic to the space of 5 by 5 Latin Squares. These simplices split into 4 copies of a quotient of S by an involution, and two copies of a space made up of even Latin Squares.
This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.
Cauchy's interlace theorem states that the characteristic polynomial of a symmetric matrix is interlaced by the characteristic polynomial of any principle submatrix. We prove this in two sentences using only the linearity of the determinant, and the fact that all eigenvalues of a symmetric matrix are real.