English

Coefficients and roots of peak polynomials

Combinatorics 2024-06-05 v2

Abstract

Given a permutation π=π1π2πnSn\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n, we say an index ii is a peak if πi1<πi>πi+1\pi_{i-1} < \pi_i > \pi_{i+1}. Let P(π)P(\pi) denote the set of peaks of π\pi. Given any set SS of positive integers, define PS(n)={πSn:P(π)=S}{\mathcal{P}_S(n)=\{\pi\in \mathfrak{S}_n:P(\pi)=S\}}. Billey-Burdzy-Sagan showed that for all fixed subsets of positive integers SS and sufficiently large nn, PS(n)=pS(n)2nS1|\mathcal{P}_S(n)|=p_S(n)2^{n-|S|-1} for some polynomial pS(x)p_S(x) depending on SS. They conjectured that the coefficients of pS(x)p_S(x) expanded in a binomial coefficient basis centered at max(S)\max(S) are all positive. We show that this is a consequence of a stronger conjecture that bounds the modulus of the roots of pS(x)p_S(x). Furthermore, we give an efficient explicit formula for peak polynomials in the binomial basis centered at 00, which we use to identify many integer roots of peak polynomials along with certain inequalities and identities.

Keywords

Cite

@article{arxiv.1410.8506,
  title  = {Coefficients and roots of peak polynomials},
  author = {Sara Billey and Matthew Fahrbach and Alan Talmage},
  journal= {arXiv preprint arXiv:1410.8506},
  year   = {2024}
}

Comments

20 pages, 5 figures and tables, final version with minor changes suggested by the referees