# Coefficients and Roots of Peak Polynomials

@article{Billey2016CoefficientsAR,
title={Coefficients and Roots of Peak Polynomials},
author={Sara C. Billey and Matthew Fahrbach and Alan Talmage},
journal={Experimental Mathematics},
year={2016},
volume={25},
pages={165 - 175}
}
• Published 30 October 2014
• Mathematics, Computer Science
• Experimental Mathematics
ABSTRACT Given a permutation , 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 . Billey–Burdzy–Sagan showed that for all fixed subsets of positive integers S and sufficiently large n, for some polynomial pS(x) depending on S. They conjectured that the coefficients of pS(x) expanded in a binomial coefficient basis centered at max (S) are all positive. We show that this is a consequence of a stronger… Expand
15 Citations

#### Topics from this paper

Descent polynomials
• Mathematics, Computer Science
• Discret. Math.
• 2019
The purpose of the present paper is to study the descent polynomial and it will be seen that it displays some interesting parallels with its peak relative. Expand
G R ] 2 2 Ja n 20 16 Peak Sets of Classical Coxeter Groups
We say a permutation π = π1π2 · · ·πn in the symmetric group Sn has a peak at index i if πi−1 < πi > πi+1 and we let P (π) = {i ∈ {1, 2, . . . , n} | i is a peak of π}. Given a set S of positiveExpand
Some coefficient sequences related to the descent polynomial
Some conjectures concerning coefficient sequences of the descent polynomial d(I,n) are proved and some zero-free regions for the descentPolynomial are described. Expand
Asymptotics of descent functions
In 1916, MacMahon showed that permutations in Sn with a fixed descent set I are enumerated by a polynomial dI(n). Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descentExpand
The pinnacle set of a permutation
• Mathematics, Computer Science
• Discret. Math.
• 2018
This article looks at a natural analogue of the peak set of a permutation, instead recording the values of the peaks, and characterize admissible pinnacle sets and study various enumerative questions related to these objects. Expand
Asymptotics of descent functions.
In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in thisExpand
Counting peaks on graphs
• Computer Science, Biology
• Australas. J Comb.
• 2019
This paper presents an algorithm for constructing all of the bijective labelings in P (S;G) for any S ⊆ V (G), and uses combinatorial methods to explore peak sets in certain well-studied families of graphs. Expand
Cyclic Pattern Containment and Avoidance
• Mathematics
• 2021
The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linearExpand
Factoring peak polynomials
• Mathematics
• 2015
Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in S_n$, we say an index $i$ is a peak if $\pi_{i-1} \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$. Given any set $S$ of positiveExpand
Roots of descent polynomials and an algebraic inequality on hook lengths
• Mathematics
• 2019
We prove a conjecture by Diaz-Lopez et al that bounds the roots of descent polynomials. To do so, we prove an algebraic inequality comparing expressions that come from Naruse's hook-length formulaExpand