Big-descent polynomials of 321-avoiding permutations
The big-descent polynomials of 321-avoiding permutations are real-rooted with negative roots, and the Motzkin reference polynomials interlace them.
Results
A big descent of a permutation $\pi$ is an index $i$ with $\pi(i)>\pi(i+1)+1$. Let $A_n(t)$ be the big-descent polynomial of the 321-avoiding permutations of length $n$. We define it by the first-return recurrence $A_0=1$, $A_n=\sum_{j=1}^n I_jA_{n-j}$, where $I_1=I_2=1$ and $I_j=t\,M_{j-2}$ for $j\ge3$. The reference Motzkin polynomials are $M_0=1$, $M_1=2$ and $$ M_{k+2}=2M_{k+1}+t\sum_{i=0}^{k}M_iM_{k-i},\qquad M_k=\sum_a\binom{k}{2a}\mathrm{Cat}_a\,2^{k-2a}t^a. $$
Theorem. For every $n\ge0$, $A_n$ is real-rooted and all its roots are negative. For $n\ge3$, $M_{n-2}\ll A_n$, both polynomials have simple roots, and they have no common root.
Use
By [ERZ26], the recurrence-defined $A_n$ is the big-descent enumerator of 321-avoiding permutations of length $n$. Together with that identification the theorem proves the case $\Pi=\{321\}$ of [ERZ26, Conj. 4.4]. See also big descents on symmetricfunctions.com.
Proof
For $n\ge25$ we expand $(c/2)^nA_n(1-c^{-2})$ in Gegenbauer polynomials and show $A_n(\rho)M_{n-2}'(\rho)<0$ at every zero $\rho$ of $M_{n-2}$, which gives interlacing. The cases $3\le n\le24$ are checked by exact computation.
References
- [ERZ26] Counting Pattern-Avoiding Permutations by Big Descents. Annals of Combinatorics, 2026.
BibTeX
@article{ElizaldeRiveraZhuang2026, author = {Elizalde, Sergi and Rivera, Johnny and Zhuang, Yan}, title = {Counting {P}attern-{A}voiding {P}ermutations by {B}ig {D}escents}, year = {2026}, journal = {Annals of Combinatorics}, publisher = {Springer Science and Business Media LLC}, doi = {10.1007/s00026-026-00805-1}, url = {http://dx.doi.org/10.1007/s00026-026-00805-1}, issn = {0219-3094} }