arXiv (All)
open access
Parking functions, Smirnov words, and noncrossing Chow polynomials
We prove real-rootedness of the Chow polynomials of the noncrossing partition lattices by transferring tieless parking functions to finite-alphabet Smirnov words and applying a last-letter interlacing recurrence. We also derive a triangular recurrence for peaks and ties and identify the peakless-tie
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Real-rooted Eulerian polynomials from permutations, words, and paths#975372
- Explicit formulas for permutation pattern character polynomials#665438
- Explicit formulas for permutation pattern character polynomials#663938
- S-meandric Permutations and Tangency Polynomials#1078139
- Restricted inversion polynomials#997452
Record · ID 972080
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive