Fundamental conjectures on exchange graphs and seeds of cluster algebras

Let nn be the rank of a cluster algebra. Its seeds, clusters, cluster variables, mutation equivalence, and exchange graph are understood in the usual sense of cluster algebra theory.

Exchange graph and seed conjectures. (a) The exchange graph of a cluster algebra with rank nn only depends on the initial exchange matrix; (b) every seed is uniquely determined by its cluster under mutation equivalence; (c) two clusters are adjacent in the exchange graph if and only if they have exactly n1n-1 common cluster variables.

These are fundamental conjectures concerning the combinatorics of cluster algebras. The supplied source describes them as conjectures, while the paper's abstract says that applications of its cluster formula and DD-matrix pattern solve some fundamental conjectures affirmatively; the supplied material does not identify which of (a)--(c) are resolved.

Sources & referencesView supporting material

Primary source

Peigen Cao and Fang Li, “Some conjectures on generalized cluster algebras via the cluster formula and D-matrix pattern”, arXiv:1611.08672 (2016).

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.