no. 17 · Wednesday 18 November 2026
Real-Rootedness and Log-Concavity of Zigzag Eulerian Polynomials
Abstract
We prove that the zigzag Eulerian polynomials have only real, negative, simple zeros, and hence strictly log-concave coefficients, settling the first two parts of a conjecture of Petersen and Zhuang. Real-rootedness in combinatorics is usually proved inside a single algebraic framework, such as interlacing or stability. Our proof rests on a different premise: different parts of a zero set become visible in different representations of the same polynomial, and classical tools suffice once each part is viewed in the right one. The bridge between representations is a local rule. Forgetting the order in which a bounded-jump path visits positions leaves only a nearest-neighbor condition on sorted gaps, which makes an encoding via a transfer matrix much simpler to see. From there the argument passes to complex analysis. The sizes of the matrix's eigenmodes locate the zeros at the two ends of the negative axis, through Rouché's theorem. In a logarithmic coordinate the generating function becomes a combination of derivatives of the hyperbolic secant, akin to the classical derivative polynomials, and the arguments of its nearest poles produce a sine that fixes the signs between consecutive central zeros. The zeros are thus read off from the poles of an associated kernel. More broadly, the proof suggests that combinatorial polynomials defined by local constraints carry analytic structure, in their spectra and in the poles of their kernels, that is complementary to the usual algebraic methods and that classical complex analysis can exploit directly.
- fields
- Combinatorics, Complex Variables