Connecting descent and peak polynomials

DOI10.15672/HUJMS.1182500arXiv1806.05353MaRDI QIDQ6503365FDOQ6503365

Abstract: A permutation

s i g m a = s i g m a_{1} s i g m a_{2} c d o t s s i g m a_{n}

has a descent at

i

if

s i g m a_{i} > s i g m a_{i + 1}

. A descent

i

is called a peak if

i > 1

and

i - 1

is not a descent. The size of the set of all permutations of

n

with a given descent set is a polynomials in

n

, called the polynomial. Similarly, the size of the set of all permutations of

n

with a given peak set, adjusted by a power of

2

gives a polynomial in

n

, called the peak polynomial. In this work we give a unitary expansion of descent polynomials in terms of peak polynomials. Then we use this expansion to give a combinatorial interpretation of the coefficients of the peak polynomial in a binomial basis, thus giving a new proof of the peak polynomial positivity conjecture.

This page was built for publication: Connecting descent and peak polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6503365)