Cluster-variable connectivity conjecture
Cluster-variable connectivity conjecture
A cluster variable is a variable occurring in a cluster, a seed is a cluster together with its exchange data, and the exchange graph is the graph whose vertices are seeds and whose edges correspond to seed mutations. Cluster-variable connectivity conjecture. For any cluster variable , the seeds whose clusters contain induce a connected subgraph of the exchange graph. This is attributed to Fomin–Zelevinsky and is presented as a conjecture about when two cluster variables can be equal; the source does not state a resolution.
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
Nathan Reading and David E Speyer, “Combinatorial frameworks for cluster algebras”, arXiv:1111.2652 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.