Abstract
We conjecture a formula for the rational q, t-Catalan polynomial Cr/s that is symmetric in q and t by definition. The conjecture posits that Cr/s can be written in terms of symmetric monomial strings indexed by maximal Dyck paths. We show that for any finite d∗ , giving a combinatorial proof of our conjecture on the infinite set of functions {Cr/sd:r≡1mods,d≤d∗} is equivalent to a finite counting problem.
Original language | English |
---|---|
Pages (from-to) | 749-795 |
Number of pages | 47 |
Journal | Annals of Combinatorics |
Volume | 28 |
Issue number | 3 |
DOIs | |
State | Accepted/In press - 1 Jan 2023 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics