Exchange graph conjectures for cluster algebras
Let be a cluster algebra with seed , principal part , rank , clusters, and exchange graph whose vertices are seeds and whose edges are seed mutations. A cluster variable is an element occurring in some cluster, and a seed is acyclic when its exchange matrix is acyclic. Exchange graph conjectures. (1) The exchange graph of depends only on the principal part of . (2) Every seed in is uniquely determined by its cluster; hence two clusters are adjacent if and only if their intersection has cardinality . (3) For any cluster variable , the seeds whose clusters contain form a connected subgraph. (4) The seeds whose exchange matrix is acyclic form a connected subgraph, possibly empty. These statements concern the combinatorial structure of exchange graphs; parts (1)--(3) are known for cluster algebras of finite type and all four are known for classical types, but the general case remains open.
References
- Sergey Fomin and Andrei Zelevinsky, “Cluster algebras: Notes for the CDM-03 conference”, arXiv:math/0311493 (2004).
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
No solutions have been posted yet.