A conjectured formula for the rational q,t-Catalan polynomial
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 1 s, \,\,\, d ≤ d*\ is equivalent to a finite counting problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.