Gamma transform
The gamma transform $\Gamma_d$ writes a palindromic polynomial in the basis $x^i(1+x)^{d-2i}$. It sends a real-rooted polynomial with nonpositive roots to a real-rooted polynomial with nonpositive roots, and conversely, and gamma transforms of adjacent degrees interlace exactly when the gamma polynomials do. Thus real-rootedness passes in both directions between a palindromic polynomial, such as an Eulerian polynomial, and its gamma polynomial.
Results
For $d\ge0$ and $\gamma=\sum_i\gamma_ix^i$, the gamma transform in ambient degree $d$ is $$ \Gamma_d(\gamma)(x)=\sum_{i=0}^{\lfloor d/2\rfloor}\gamma_i\,x^i(1+x)^{d-2i}. $$ A palindromic polynomial $p$ with center of symmetry $d/2$ is $\Gamma_d(\gamma_p)$ for a unique gamma polynomial $\gamma_p$ of degree at most $d/2$; $p$ is gamma-positive if $\gamma_p$ has nonnegative coefficients.
Theorem (real roots). Let $\deg\gamma\le d/2$. Then $\gamma$ is nonzero and real-rooted with only nonpositive roots if and only if $\Gamma_d(\gamma)$ is. If $\gamma\ne0$ is real-rooted with nonnegative coefficients, then $\Gamma_d(\gamma)$ is nonzero and real-rooted.
Theorem (Hoster–Stump). Let $\deg\gamma\le d/2$ and $\deg\delta\le(d+1)/2$, where $\gamma,\delta$ have nonnegative coefficients and nonzero constant terms. Then $\Gamma_d(\gamma)\ll\Gamma_{d+1}(\delta)$ if and only if $\gamma\ll\delta$.
Theorem (roots). Let $\deg\gamma\le d/2$ with $\gamma\ne0$, and suppose all roots of $\Gamma_d(\gamma)$ are negative. Then the roots of $\Gamma_d(\gamma)$, with multiplicity, are the roots $x\in(-1,0)$, their reciprocals $1/x$, and $-1$ with multiplicity $d-2\deg\gamma$.
Theorem (strict lifting). Let $n\ge2$, and let $A,B$ have positive leading coefficients, only negative roots, and degrees $\lfloor(n-1)/2\rfloor$ and $\lfloor n/2\rfloor$. If $A\ll B$ and $A,B$ have no common root, then $\Gamma_{n-1}(A)$ and $\Gamma_n(B)$ have degrees $n-1$ and $n$, simple negative roots and no common root, and $\Gamma_{n-1}(A)\ll\Gamma_n(B)$.
Theorem (two steps). Let $\gamma\ll\delta$ have nonnegative coefficients and nonzero constant terms, with $\deg\gamma\le n$ and $\deg\delta\le n+1$. Then $$ \Gamma_{2n}(\gamma)\ \ll\ (x+1)\,\Gamma_{2n}(\gamma)\ \ll\ \Gamma_{2n+2}(\delta). $$
Proposition (gamma pencil). For $n\ge2$ let $T_nf=(1+2nx)\,f+x(1-4x)\,f'$, and put $U_2=1$, $V_2=x$, $U_{n+1}=T_nU_n$ and $V_{n+1}=T_nV_n$. Then $T_n$ maps every real-rooted polynomial of degree at most $n/2$ to zero or a real-rooted polynomial. For all real $a,b$, $aU_n+bV_n$ is zero or real-rooted, and $U_n\ll V_n$.
Proof
Since $\Gamma_d(\gamma)(x)=(1+x)^d\gamma\bigl(x/(1+x)^2\bigr)$ and $x/(1+x)^2$ maps $(-\infty,0]\setminus\{-1\}$ onto $(-\infty,0]$, each nonpositive root $y$ of $\gamma$ pulls back to two real roots, which are nonpositive because $y\le0<1/4$. For the pencil, $T_n$ has a stable algebraic symbol, so the finite Borcea–Brändén theorem [Bra15] applies.
References
- [Pet15, Sec. 4.6]
- [HS25, Prop. 2.5], for the interlacing equivalence
- [Zha26], for the strict lifting
- [Bra15]
- Gamma polynomials on symmetricfunctions.com
- [Pet15] Eulerian Numbers. Birkhäuser Advanced Texts Basler Lehrbücher, Birkhäuser, 2015.
BibTeX
@book{Petersen2015EulerianNumbers, author = {T. Kyle Petersen}, title = {Eulerian Numbers}, series = {Birkhäuser Advanced Texts Basler Lehrbücher}, publisher = {Birkhäuser}, address = {New York}, year = {2015}, isbn = {978-1-4939-3091-3}, doi = {10.1007/978-1-4939-3091-3}, url = {https://doi.org/10.1007/978-1-4939-3091-3} } - [HS25] Chow polynomials of simplicial posets with positive $h$-vector are real-rooted. arXiv e-prints, 2025.
BibTeX
@article{HosterStump2025x, author = {Elena Hoster and Christian Stump}, title = {Chow polynomials of simplicial posets with positive $h$-vector are real-rooted}, year = {2025}, eprint = {2508.15538}, url = {https://arxiv.org/abs/2508.15538}, journal = {arXiv e-prints} } - [Bra15] Unimodality, Log-Concavity, Real-Rootedness and Beyond. Handbook of enumerative combinatorics, 437-483, 2015.
BibTeX
@incollection{Branden2015, doi = {10.1201/b18255-10}, year = {2015}, month = mar, publisher = {Chapman and Hall/{CRC}}, pages = {437--483}, author = {Petter Br{\"{a}}nd{\'{e}}n}, title = {Unimodality, Log-Concavity, Real-Rootedness and Beyond}, booktitle = {Handbook of Enumerative Combinatorics} } - [Zha26] Strict Interlacing of the Descent Polynomials of Separable Permutations. 2026.
BibTeX
@unpublished{Zhang2026SeparableInterlacing, author = {Zhang, Zhanhe}, title = {Strict Interlacing of the Descent Polynomials of Separable Permutations}, date = {2026-09-10}, year = {2026}, note = {SSRN preprint 7510941, posted September 25, 2026}, doi = {10.2139/ssrn.7510941}, url = {https://ssrn.com/abstract=7510941} }