The f-polynomial transform
The f-polynomial transform converts derivative recurrences into derivative recurrences, preserves and reflects real-rootedness, and transfers interlacing of rows with half-growth degrees.
Results
For $d\ge0$ and a polynomial $h$ of degree at most $d$ with coefficients $h_k$, the f-polynomial transform is $$ f_d(h)=\sum_{k=0}^{d}h_k\,x^k(x+1)^{d-k}. $$ It is the substitution $x\mapsto x/(x+1)$ homogenized to degree $d$.
Theorem (derivative rule). If $\deg p\le d$, then $$ (x+1)^2\,f_d(p)'=d\,(x+1)\,f_d(p)+f_d(p'). $$
Theorem (recurrences). Let $a,b,q$ be polynomials with $\deg a\le2$, $\deg b\le1$, $\deg q\le d$ and $\deg(aq'+bq)\le d+1$. Then $$ f_{d+1}(aq'+bq)=(x+1)\,f_2(a)\,f_d(q)'+\bigl(f_1(b)-d\,f_2(a)\bigr)f_d(q). $$ Consequently, let $Q_{n+1}=a_nQ_n'+b_nQ_n$ with $\deg a_n\le2$, $\deg b_n\le1$ and $\deg Q_n\le n$, and let $P_0=f_0(Q_0)$ and $$ P_{n+1}=(x+1)\,f_2(a_n)\,P_n'+\bigl(f_1(b_n)-n\,f_2(a_n)\bigr)P_n. $$ Then $P_n=f_n(Q_n)$ for all $n$. The degree bound $\deg Q_n\le n$ holds if $Q_0$ is constant.
Theorem (real roots). Let $\deg p\le d$. Then $f_d(p)$ is real-rooted if and only if $p$ is real-rooted. In particular, if $P_n=f_n(Q_n)$ with $\deg Q_n\le n$ and every $Q_n$ real-rooted, then every $P_n$ is real-rooted.
Theorem (roots and interlacing). Let $p\ne0$ be real-rooted with $p(1)\ne0$. Then the roots of $f_{\deg p}(p)$ are the numbers $r/(1-r)$ for the roots $r$ of $p$. If $f\ll g$ and all roots of $f$ and $g$ are below $1$, or all are above $1$, then $f_{\deg f}(f)\ll f_{\deg g}(g)$.
Theorem (half-growth sequences). Let $Q_j$ be nonzero real-rooted polynomials with nonnegative coefficients, $\deg Q_j=\lfloor (j+1)/2\rfloor$ and $Q_j\ll Q_{j+1}$ for all $j$. Then $f_n(Q_n)\ll f_{n+1}(Q_{n+1})$ for all $n\ge1$.
Theorem (Euler shifts). Let $\theta=x\,d/dx$. If $\deg p\le n$ and $a\in\mathbb R$, then $$ f_n\bigl(\theta p+ap\bigr)=(a-nx)\,f_n(p)+x(1+x)\,f_n(p)'. $$ Let $F$ be real-rooted of degree $n$ with positive leading coefficient and all roots in $[-1,0]$, and let $a\in\mathbb R$. Then $(a-nx)F+x(1+x)F'$ is real-rooted. If $a>0$, it has degree $n$ and positive leading coefficient, and $F\ll(a-nx)F+x(1+x)F'$. For $n\ge1$, all real-rooted $F$ of degree $n$ with positive leading coefficient and roots in $[-1,0]$ are mapped to polynomials with roots in $[-1,0]$ if and only if $a\ge0$ or $a\le-n$.
Use
The alternating-runs polynomials are f-transforms of peak polynomials, and the peak polynomials have the half-growth degree pattern. Real-rootedness and interlacing of the peak polynomials therefore pass to the alternating-runs polynomials, for example the rows of OEIS A008970, A059427 and A186370.
Proof
The derivative rule is a direct computation. For the Euler shifts, every real-rooted $F$ of degree $n$ with positive leading coefficient and roots in $[-1,0]$ is $f_n(q)$ for a Pólya frequency polynomial $q$ of degree at most $n$, and $q\mapsto\theta q+aq$ preserves real-rootedness of such polynomials.
References
See [BS19] and the symmetric-decomposition overview on symmetricfunctions.com.
- [BS19] Symmetric Decompositions and Real-Rootedness. International Mathematics Research Notices, 2021(10), 7764-7798, 2019.
BibTeX
@article{BrandenSolus2019, title = {Symmetric Decompositions and Real-Rootedness}, volume = {2021}, ISSN = {1687-0247}, url = {http://dx.doi.org/10.1093/imrn/rnz059}, DOI = {10.1093/imrn/rnz059}, number = {10}, journal = {International Mathematics Research Notices}, publisher = {Oxford University Press (OUP)}, author = {Br\"{a}ndén, Petter and Solus, Liam}, year = {2019}, month = apr, pages = {7764--7798} }