2000 character limit reached
Some coefficient sequences related to the descent polynomial
Published 2 Jun 2018 in math.CO | (1806.00689v2)
Abstract: The descent polynomial of a finite $I\subseteq \mathbb{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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.