Comments on Exchange Graphs in Cluster Algebras

TL;DR

This paper investigates the fundamental group of exchange graphs in cluster algebras, providing examples, counterexamples, and a refined conjecture specifically for acyclic seeds, to understand the structure of loops generated by mutations.

Contribution

It offers new insights into the structure of exchange graphs in cluster algebras, challenging a naive conjecture and proposing a refined version for acyclic cases.

Findings

Counterexamples to the naive conjecture.

A refined conjecture for acyclic seeds.

Insights into the structure of exchange graphs.

Abstract

An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum dilogarithm functions. An interesting conjecture, partly motivated by dilogarithm functions, is that this fundamental group is generated by closed loops of mutations involving only two of the cluster variables. We present examples and counterexamples for this naive conjecture, and then formulate a better version of the conjecture for acyclic seeds.