Real-rootedness and interlacing for parking functions and Chow polynomials

RESUMO

We prove real-rootedness for the Chow polynomials of the noncrossing partition lattices by transferring tieless parking functions to finite-alphabet Smirnov words and applying an interlacing-preserving transition of M.~Leander. We also derive a triangular recurrence for peaks and ties and identify the peakless-tieless descent polynomial as the Narayana polynomial. For the toric $g$-contributions of Ehrenborg--Hetyei--Readdy, we exhibit a fixed-row common interlacer and establish real-rootedness of all nonnegative row sums. Individual real-rootedness follows in particular; Q.~Xiao also proved it by a different differential recurrence. We also give a second proof of the individual statement, by finite Schur--Szegő convolution, that does not use the common interlacer. These results prove Conjecture~4.2 of Xiao and Conjecture~11.2 of Ehrenborg--Hetyei--Readdy, with consequences for weakly 123-avoiding parking functions. We also prove real-rootedness for the image-size polynomial on all parking functions and for the ascent and descent polynomials of four two-pattern-avoiding classes.