Ranked cluster-variable counting formulas for Grassmannian cluster algebras

From papers

For positive integers k,n,rk,n,r, let Nk,n,rN_{k,n,r} denote the number of cluster variables of rank rr in C[Gr(k,n)]\mathbb{C}[\operatorname{Gr}(k,n)]. Cluster-variable counting conjecture. The corresponding numbers satisfy

N3,n,3=24(n8)+9(n9),N_{3,n,3}=24\binom{n}{8}+9\binom{n}{9}, N3,n,4=288(n9)+400(n10)+264(n11)+48(n12),N_{3,n,4}=288\binom{n}{9}+400\binom{n}{10}+264\binom{n}{11}+48\binom{n}{12}, N4,n,3=174(n8)+855(n9)+1285(n10)+693(n11)+123(n12).N_{4,n,3}=174\binom{n}{8}+855\binom{n}{9}+1285\binom{n}{10}+693\binom{n}{11}+123\binom{n}{12}.

These formulas are extrapolated from computational results for Grassmannian cluster algebras and concern finite-rank slices of settings where the total number of cluster variables can be infinite; their general validity remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Man-Wai Cheung, Pierre-Philippe Dechant, Yang-Hui He, Elli Heyes, Edward Hirst and Jian-Rong Li, “Clustering Cluster Algebras with Clusters”, arXiv:2212.09771 (2026).

Solutions 0

No solutions have been posted yet.