Real-Rootedness and Log-Concavity of Zigzag Eulerian Polynomials

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22110
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Real-Rootedness and Log-Concavity of Zigzag Eulerian Polynomials

Ethan Torres
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Real-Rootedness and Log-Concavity of Zigzag Eulerian Polynomials

Ethan Torres
preprint en

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.

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon