The saturation conjecture for F-polynomials of cluster monomials
Let denote the -polynomial associated with a representation, and call its support saturated if every lattice point in the Newton polytope of has a nonzero coefficient. The saturation conjecture. The support of the -polynomial of a cluster monomial in any cluster algebra is saturated. Saturation is proved for rigid representations of acyclic quivers, but the conjecture concerns cluster monomials in arbitrary cluster algebras.
References
Primary source
Jiarui Fei, “Combinatorics of F-polynomials”, arXiv:1909.10151 (2021).
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.