The rational Catalan area-codinv conjecture for coprime Dyck paths

Let mm and nn be coprime positive integers. An (m,n)(m,n)-Dyck path is a lattice path from (0,0)(0,0) to (m,n)(m,n) staying on the prescribed side of the main diagonal; let area(D)\operatorname{area}(D) be the number of lattice squares between DD and the main diagonal, and let codinv(D)\operatorname{codinv}(D) be the Dyck path statistic given by a simple geometric construction. Define [a]q=1+q++qa1[a]_q=1+q+\cdots+q^{a-1} and [m+nm,n]q\left[m+n \atop m,n \right]_q as the relevant qq-multinomial coefficient. The rational Catalan area-codinv conjecture.

DDm,nqarea(D)+codinv(D)=Catm,n(q)=1[m+n]q[m+nm,n]q.\sum_{D\in \mathcal D_{m,n}}q^{\operatorname{area}(D)+\operatorname{codinv}(D)}=\operatorname{Cat}_{m,n}(q)=\frac{1}{[m+n]_q}\left[m+n \atop m,n \right]_q.

This conjecture seeks a combinatorial interpretation of the rational Catalan polynomial and arose from the rational Shuffle conjecture; it was also formulated in related work of Armstrong and collaborators. The source provides no resolution status.

Sources & referencesView supporting material

Primary source

Guoce Xin, “Rank complement of rational Dyck paths and conjugation of (m,n)-core partitions”, arXiv:1504.02075 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.