2000 character limit reached
On $q$-analogs of descent and peak polynomials
Published 10 Dec 2019 in math.CO | (1912.04933v2)
Abstract: Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine the enumeration by the length of the permutations. In the case of $q$-descent polynomials we prove that the coefficients in one basis are strongly $q$-log concave, and conjecture this property in another basis. For peaks, we prove that the $q$-peak polynomial is palindromic in $q$, resolving a conjecture of Diaz-Lopez, Harris, and Insko.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.