Metraipolis › archive › dc_71d963cce477
Real-rootedness and interlacing for parking functions and Chow polynomials — arXiv:2609.05131
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05131
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T23:21:11.580Z
- SHA-256 of the archived text
8dbd3547668805fcb525f6b0d3204812fc367ca4d67d06eaa1ef2748871a910f- Stable URL of this page
https://metraipolis.com/documento/dc_71d963cce477
How to cite
Real-rootedness and interlacing for parking functions and Chow polynomials — arXiv:2609.05131 — arXiv (en), https://arxiv.org/abs/2609.05131 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_71d963cce477 (Metraipolis archive dc_71d963cce477, sha256 8dbd3547668805fcb525f6b0d3204812fc367ca4d67d06eaa1ef2748871a910f)
BibTeX
@misc{dc71d963cce477,
title = {Real-rootedness and interlacing for parking functions and Chow polynomials — arXiv:2609.05131},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05131},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_71d963cce477; sha256 8dbd3547668805fcb525f6b0d3204812fc367ca4d67d06eaa1ef2748871a910f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05131. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.05131 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T23:03:13.262Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).