Zig-zag Eulerian polynomials
The zig-zag Eulerian polynomials count alternating permutations by swaps. They have only distinct negative roots, which settles a conjecture of Petersen and Zhuang; the key input is a disk bound for the zeros of a centered family.
Results
Let $H_n(t)=\sum_\pi t^{\operatorname{sw}(\pi)}$ over the permutations $\pi$ of $[n]$ with $\pi_1<\pi_2>\pi_3<\dotsb$, where a swap of $\pi$ is a value $i$ with $\pi^{-1}(i)+1<\pi^{-1}(i+1)$ and $\operatorname{sw}(\pi)$ is the number of swaps. Then $H_0=H_1=H_2=1$, $H_3=1+t$ and $H_4=1+3t+t^2$.
Theorem. For every $n\ge1$, $H_n$ has degree $\max(n-2,0)$, splits over $\mathbb R$, and has distinct strictly negative roots.
This settles Conjecture 6.1(a) of Petersen and Zhuang: their $Z_n(t)=tH_n(t)$ is real-rooted.
Proposition (recurrence). Let $w_{n,k}$ be the number of words $u_1\le u_2\ge u_3\le\dotsb$ of length $n$ over the alphabet $[k]$. Then $w_{0,k}=1$, $w_{n,0}=0$ for $n>0$ and, for $n>0$, $$ 2w_{n,k+1}=2w_{n,k} +\sum_{p=0}^{n-1}w_{p,k}w_{n-1-p,k+1} +\mathbf{1}_{n=1}+\mathbf{1}_{n\geq2}w_{n-2,k+1}. $$ For $n\ge1$ the coefficients of $H_n$ are recovered by $$ a_{n,j}=w_{n,j+1}-\sum_{i=0}^{j-1}a_{n,i}\binom{n+j-i}{n}, \qquad H_n(t)=\sum_{j=0}^{n}a_{n,j}t^j , $$ and $a_{n,j}=0$ for $j>\max(n-2,0)$.
Theorem (disk bound). Let $p_n(c)$ be the coefficients of $$ \sum_{n\geq 0} p_n(c)\, s^n = \sqrt{1-s^2}\,(\sec + \tan)\bigl(c \arcsin s\bigr), $$ so that $p_n(c) = \sum_k e_k\, \alpha_{n,k}\, c^k$ with $e_k = [z^k](\sec z + \tan z)$ and $\alpha_{n,k} = [s^n]\sqrt{1-s^2}\,(\arcsin s)^k$. For $n \geq 2$, every complex zero $c$ of $p_n$ satisfies $|c|^2 < 13/3$.
Let $L F = (x^2-1)\,F' + 3x\,F$, and call a polynomial interval-simple if it splits over $\mathbb R$ with only simple roots, all in $(-1,1)$. For nonzero $F$, $\deg LF=\deg F+1$, with the leading coefficient multiplied by $\deg F+3$. If $F\ne0$ is interval-simple and $-3<a<3$, then $(L-a)F$ is interval-simple; if $F$ is interval-simple of degree at least $4$ and $a^2+b^2\le 13/3$, then $\bigl((L-a)^2+b^2\bigr)F$ is interval-simple. Consequently, if $Q\ne0$ has degree at least $3$, $Q(-x)=\pm Q(x)$ and all complex roots of $Q$ satisfy $|c|^2\le 13/3$, then $Q(L)\,1$ is interval-simple. Finally, if $G$ is interval-simple and $H\ne0$ has $\deg H\le\deg G$ and vanishes at $(z-1)/(z+1)$ for every root $z$ of $G$, then $H$ has the degree of $G$ and only simple negative roots.
Proof
Weak alternating words identify a centered polynomial built from $p_n$ with the swap enumerator. The disk bound follows [Ale26, App. A–B]: a Riccati equation for the generating function, an exact matrix for multiplication by $c^2$ on the centered basis, and a weighted column-sum estimate for that matrix. The operator $L$ then inserts one real or conjugate-pair factor of $Q$ at a time, starting from cubic or even quartic seeds, which gives roots in $(-1,1)$. The map $z\mapsto(z-1)/(z+1)$ sends $(-1,1)$ to the negative real axis.
References
- [Ale26] Real-rooted Eulerian polynomials from permutations, words, and paths. arXiv e-prints, 2026.
BibTeX
@article{Alexandersson2026Eulerian, author = {Per Alexandersson}, title = {Real-rooted {E}ulerian polynomials from permutations, words, and paths}, year = {2026}, eprint = {2609.07325v2}, url = {https://arxiv.org/abs/2609.07325v2}, journal = {arXiv e-prints} } - [PZ24, Conjecture 6.1(a)] Zig-zag Eulerian polynomials. arXiv e-prints, 2024.
BibTeX
@article{PetersenZhuang2024x, Author = {T. Kyle Petersen and Yan Zhuang}, Title = {Zig-zag {E}ulerian polynomials}, Year = {2024}, Eprint = {2403.07181}, url = {https://arxiv.org/abs/2403.07181}, journal = {arXiv e-prints} } - [CS23] The $h^*$-polynomial of the order polytope of the zig-zag poset. The Electronic Journal of Combinatorics, 30(2), P2.44, 2023.
BibTeX
@article{CoonsSullivant2023, author = {Jane Ivy Coons and Seth Sullivant}, title = {The {$h^*$}-polynomial of the order polytope of the zig-zag poset}, journal = {The Electronic Journal of Combinatorics}, volume = {30}, number = {2}, pages = {P2.44}, year = {2023}, doi = {10.37236/11526} }