A unified approach to polynomial sequences with only real zeros
arXiv:math/0509207 · doi:10.1016/j.aam.2006.02.003
Abstract
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for certain classes of graphs, while showing that they are false in general.
19 pages, Advances in Applied Mathematics, in press
References in corpus (1)
Cited by in corpus (15)
- Total positivity of Riordan arrays
- On the unimodality of independence polynomials of some graphs
- Moments of random matrices and hypergeometric orthogonal polynomials
- Proofs of some conjectures on monotonicity of number-theoretic and combinatorial sequences
- Polynomials with palindromic and unimodal coefficients
- Analytic combinatorics of coordination numbers of cubic lattices
- The converse of Weyl's eigenvalue inequality
- Multimodality of the Markov binomial distribution
- On colored set partitions of type
- Weighted random staircase tableaux
- On random convex chains, orthogonal polynomials, PF sequences and probabilistic limit theorems
- On the Conjecture of Stability Preservation in Arbitrary-Order Adams-Bashforth-Type Integrators
- A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case
- Inertia indices and eigenvalue inequalities for Hermitian matrices
- Genus Polynomials of Cubic Graphs with Non-Real Roots