English

A conjectured formula for the rational $q,t$-Catalan polynomial

Combinatorics 2024-12-31 v2

Abstract

We conjecture a formula for the rational q,tq,t-Catalan polynomial Cr/s\mathcal{C}_{r/s} that is symmetric in qq and tt by definition. The conjecture posits that Cr/s\mathcal{C}_{r/s} can be written in terms of symmetric monomial strings indexed by maximal Dyck paths. We show that for any finite dd^*, giving a combinatorial proof of our conjecture on the infinite set of functions {Cr/sd:r1mods,dd}\{ \mathcal{C}_{r/s}^d: r\equiv 1 \mod s, \,\,\, d \leq d^*\} is equivalent to a finite counting problem.

Keywords

Cite

@article{arxiv.2208.00577,
  title  = {A conjectured formula for the rational $q,t$-Catalan polynomial},
  author = {Graham Hawkes},
  journal= {arXiv preprint arXiv:2208.00577},
  year   = {2024}
}
R2 v1 2026-06-25T01:22:05.321Z