The extended g-vector classification conjecture for real prime modules

About 1 year old · traced to

Let Ql≤ξ\mathcal{Q}^{\leq \xi}_l be the principal quiver of Γl≤ξ\Gamma^{\leq \xi}_l, let Cl≤ξ\mathcal{C}^{\leq \xi}_l be its associated cluster category, and let Cl≤ξ\mathscr{C}^{\leq \xi}_l be the corresponding monoidal categorification. For an indecomposable reachable rigid object MM, write g~(M)\widetilde{\mathbf{g}}(M) for its extended g\mathbf{g}-vector, g(M)\mathbf{g}(M) for its g\mathbf{g}-vector, and FMF_M for its FF-polynomial; let P\mathbb{P} be the tropical semifield generated by the variables yi,ry_{i,r}. The extended g\mathbf{g}-vector classification conjecture. A non-frozen real prime module in Cl≤ξ\mathscr{C}^{\leq \xi}_l is completely determined by the extended g\mathbf{g}-vector of the corresponding indecomposable reachable rigid object up to equivalence, and the map

Φl≤ξ:{indecomposable reachable rigid objects in Cl≤ξ}⟶{classes of non-frozen real prime objects in Cl≤ξ}\Phi^{\leq \xi}_{l}: \{\text{indecomposable reachable rigid objects in }\mathcal{C}^{\leq \xi}_l\}\longrightarrow\{\text{classes of non-frozen real prime objects in }\mathscr{C}^{\leq \xi}_l\} M⟼[L((zl≤ξ)g~(M))]M\longmapsto\left[L\left((\mathbf{z}^{\leq \xi}_l)^{\widetilde{\mathbf{g}}(M)}\right)\right]

defines a bijection, where

(zl≤ξ)g~(M)=(zl−1≤ξ)g(M)FM∣P((yi,r)(i,r)∈I^l−1≤ξ).(\mathbf{z}^{\leq \xi}_l)^{\widetilde{\mathbf{g}}(M)}=\frac{(\mathbf{z}^{\leq \xi}_{l-1})^{\mathbf{g}(M)}}{F_M|_{\mathbb{P}}\left((y_{i,r})_{(i,r)\in\widehat{I}^{\leq \xi}_{l-1}}\right)}.

This conjecture proposes a classification of non-frozen real prime modules by extended g\mathbf{g}-vectors. The surrounding results establish the relevant cluster-algebra and categorification correspondences, but the asserted bijection remains open.

References

Primary source

Bing Duan and Ralf Schiffler, “Classification of real modules in monoidal categorifications of cluster algebras”, arXiv:2512.16107 (2026).

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.