Face connectivity conjecture for cluster algebras
Face connectivity conjecture for cluster algebras
Let be a set of cluster variables. 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. Face connectivity conjecture. For any set of cluster variables, the seeds whose clusters contain as a subset induce a connected subgraph of the exchange graph. The source calls this a stronger conjecture and says it will be proved for some matrices ; no general resolution is given.
Sources & referencesView supporting material
Primary source
Nathan Reading and David E Speyer, “Combinatorial frameworks for cluster algebras”, arXiv:1111.2652 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.