Paperlane

no. 3 · Tuesday 27 October 2026

Real-rooted Eulerian polynomials from permutations, words, and paths

Per Alexandersson

math.CO · v2 · 28 pp

Abstract

We study seven Eulerian-type polynomial families. We prove that the descent polynomials of derangements are real-rooted, settling the derangement part of a conjecture of S.~Fu, Z.~Lin, and J.~Zeng. We also resolve the real-rootedness conjecture in OEIS A335340, strengthen the known rowwise real-rootedness of an even-top descent family to consecutive strict interlacing, and prove real-rootedness, consecutive interlacing, and real-rooted gamma-polynomials for U.~Shankar's super-Eulerian polynomials. A differential recurrence gives consecutive weak interlacing for ternary words counted by increasing runs. We prove stability of the peak-value refinement and consecutive interleaving of its positive weighted diagonals, settling a conjecture of P.~Alexandersson and O.~Nabawanda. Finally, we prove that the zig-zag Eulerian polynomials, which enumerate swaps in alternating permutations, have simple negative roots, settling the real-rootedness conjecture of T.~Kyle Petersen and Y.~Zhuang.

comments
28 pages, comments welcome. Theorems are Lean formalized, see https://peralexandersson.github.io/RealRooted/
fields
Combinatorics
pdf ↗ page arXiv:2609.07325 ↗