Coefficients and roots of peak polynomials

Abstract

Given a permutation π=π1π2·s πn ∈ Sn, we say an index i is a peak if πi-1 < πi > πi+1. Let P(π) denote the set of peaks of π. Given any set S of positive integers, define PS(n)=\π∈ Sn:P(π)=S\. Billey-Burdzy-Sagan showed that for all fixed subsets of positive integers S and sufficiently large n, |PS(n)|=pS(n)2n-|S|-1 for some polynomial pS(x) depending on S. They conjectured that the coefficients of pS(x) expanded in a binomial coefficient basis centered at (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). Furthermore, we give an efficient explicit formula for peak polynomials in the binomial basis centered at 0, which we use to identify many integer roots of peak polynomials along with certain inequalities and identities.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…