Cluster-variable connectivity conjecture

At least 14 years old · documented by

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 xx, the seeds whose clusters contain xx 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.

References

Primary source

Nathan Reading and David E Speyer, “Combinatorial frameworks for cluster algebras”, arXiv:1111.2652 (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.