Abstract

The descent polynomial of a finite I⊆Z+ is the polynomial d(I,n), for which the evaluation at n>max(I) is the number of permutations on n elements, such that I is the set of indices where the permutation is descending. In this paper, we will prove some conjectures concerning coefficient sequences of d(I,n). As a corollary, we will describe some zero-free regions for the descent polynomial.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call