Threshold matrices
Matrices whose rows have entries $x$ before a threshold and $1$ after it, with weakly increasing thresholds and a compatibility condition on the markers, preserve interlacing sequences.
Results
An interlacing sequence is a list of nonzero real-rooted polynomials with nonnegative coefficients in which each polynomial interlaces every later one. In a weak interlacing sequence zero polynomials are allowed.
A threshold row with threshold $t$ and marker $\alpha$ has entry $x$ in the columns before $t$, the marker $\alpha$ in column $t$, and $1$ after it. Applied to $(f_j)$ it gives $x\sum_{j<t}f_j+\alpha f_t+\sum_{j>t}f_j$.
Theorem (row-threshold matrices). Let $G$ be an $m\times n$ matrix whose entries are linear forms $a+bx$ with $a,b\ge0$. Assume that row $i$ has a threshold $p_i$: the coefficient of $x$ is positive only in columns before $p_i$, and the constant coefficient is positive only from column $p_i$ on. Assume $p_1\le\dots\le p_m$, and that for rows $i_1\le i_2$ and columns $j_1\le j_2$, with $a=G_{i_1j_1}$, $b=G_{i_1j_2}$, $c=G_{i_2j_1}$, $d=G_{i_2j_2}$, the polynomial $(sx+t)b+d$ interlaces $(sx+t)a+c$ for all $s,t>0$. Then $G$ maps an interlacing sequence of length $n$ to an interlacing sequence. If this condition holds with zero polynomials allowed, $G$ maps an interlacing sequence to a weak interlacing sequence of nonnegative polynomials, and discarding the zero polynomials leaves an interlacing sequence. This specializes the matrix criterion [Bra15, Thm. 7.8.5] of the matrix interlacing page.
Theorem (Haglund–Zhang). [HZ19] Let $G$ be a threshold matrix whose markers are $1$ or $1+x$, whose thresholds weakly increase down the rows, and in which, among rows with equal threshold, a marker $1+x$ is never followed by the marker $1$. Then $G$ maps an interlacing sequence to a weak interlacing sequence of nonnegative polynomials. Consequently the binomial Eulerian polynomials, defined by the Haglund–Zhang recursion on refined vectors (marker $1+x$ at threshold $0$ and $1$ at every later threshold), are real-rooted, which confirms a conjecture of Ma, Ma and Yeh [MMY17].
Theorem (Gustafsson–Solus, Lemma 3.4). [GS20, Lemma 3.4] Let each row have entries $x$ before its threshold $\varphi_i$, entry $1$ or $0$ in column $\varphi_i$ (a dropped pivot), and $1$ after it. If the thresholds weakly increase and, among rows with equal threshold, a dropped pivot is never followed by a row with an undropped pivot, then the matrix maps an interlacing sequence to a weak interlacing sequence of nonnegative polynomials.
Use
Gustafsson and Solus use the last theorem to prove that the box polynomials of $s$-lecture hall simplices, which generalize the derangement polynomials, are real-rooted. The binomial Eulerian polynomials, with the row $1$ prepended, are the rows of OEIS A046802, the $h$-polynomials of the stellohedra. The binomial Eulerian real-rootedness assertion on symmetricfunctions.com is an application of the Haglund–Zhang theorem.
References
[Bra15, Thm. 7.8.5]; [HZ19]; [GS20]; [MMY17].
- [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} } - [HZ19] Real-rootedness of variations of Eulerian polynomials. Advances in Applied Mathematics, 109, 38-54, 2019.
BibTeX
@article{HaglundZhang2019, doi = {10.1016/j.aam.2019.05.001}, url = {https://doi.org/10.1016/j.aam.2019.05.001}, year = {2019}, month = aug, publisher = {Elsevier {BV}}, volume = {109}, pages = {38--54}, author = {James Haglund and Philip B. Zhang}, title = {Real-rootedness of variations of {E}ulerian polynomials}, journal = {Advances in Applied Mathematics} } - [GS20] Derangements, Ehrhart theory, and local h-polynomials. Advances in Mathematics, 369, 107169, 2020.
BibTeX
@article{GustafssonSolus2020, doi = {10.1016/j.aim.2020.107169}, url2 = {https://doi.org/10.1016/j.aim.2020.107169}, year = {2020}, month = aug, publisher = {Elsevier {BV}}, volume = {369}, pages = {107169}, author = {Nils Gustafsson and Liam Solus}, title = {Derangements, {E}hrhart theory, and local h-polynomials}, journal = {Advances in Mathematics} } - [MMY17] Recurrence relations for binomial-Eulerian polynomials. arXiv e-prints, 2017.
BibTeX
@article{MaMaYeh2017x, author = {Jun Ma and Shi-Mei Ma and Yeong-Nan Yeh}, title = {Recurrence relations for binomial-{E}ulerian polynomials}, year = {2017}, eprint = {1711.09016v2}, url = {https://arxiv.org/abs/1711.09016v2}, journal = {arXiv e-prints} }