Descent polynomials
Abstract
Let be a nonnegative integer and be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group with descent set is a polynomial in . We call this the descent polynomial. However, basic properties of these polynomials such as a description of their coefficients and roots do not seem to have been studied in the literature. Much more recently, in 2013, Billey, Burdzy, and Sagan showed that the number of elements of with peak set is a polynomial in times a certain power of two. Since then, there have been a flurry of papers investigating properties of this peak polynomial. The purpose of the present paper is to study the descent polynomial. We will see that it displays some interesting parallels with its peak relative. Conjectures and questions for future research are scattered throughout.
Cite
@article{arxiv.1710.11033,
title = {Descent polynomials},
author = {Alexander Diaz-Lopez and Pamela E. Harris and Erik Insko and Mohamed Omar and Bruce E. Sagan},
journal= {arXiv preprint arXiv:1710.11033},
year = {2017}
}
Comments
26 pages, 3 figures