Probabilistic bounds on the coefficients of polynomials with only real zeros

摘要

The work of Harper and subsequent authors has shown that finite sequences (a(0),..., a(n)) arising from combinatorial problems are often such that the polynomial A(z):=Sigma(k=0)(n) a(k)z(k) has only real zeros. Basic examples include rows from the arrays of binomial coefficients, Stirling numbers of the first and second kinds, and Eulerian numbers. Assuming the a(k) are nonnegative, A(1)>0 and that A(z) is not constant, it is known that A(z) has only real zeros iff the normalized sequence (a(0)/A(1),..., a(n)/A(1)) is the probability distribution of the number of successes in n independent trials for some sequence of success probabilities. Such sequences (a(0),..., a(n)) are also known to be characterized by total positivity of the infinite matrix (a(i-j)) indexed by nonnegative integers i and j. This papers reviews inequalities and approximations for such sequences, called Polya frequency sequences which follow from their probabilistic representation. In combinatorial examples these inequalities yield a number of improvements of known estimates. (C) 1997 Academic Press.