Related papers: Comments on Exchange Graphs in Cluster Algebras
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
We prove a conjecture about the vertices and edges of the exchange graph of a cluster algebra $\A$ in two cases: when $\A$ is of geometric type and when $\A$ is arbitrary and its exchange matrix is nondegenerate. In the second case we also…
Every two seeds in a field of fractions $\mathcal{F}$ together with a symmetric group element gives rise to an automorphism of $\mathcal{F}$ called an exchange automorphism. For positive cluster algebras, we provide equivalent conditions…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
The statement in the title was proved in \cite{Cao23} by introducing dominant sets of seeds, which are analogs of torsion classes in representation theory. In this note, we observe a short proof by the existence of consistent cluster…
We investigate how exchange-graph techniques can be used to study the topology of strata of meromorphic quadratic differentials. The exchange graph provides natural generators for the fundamental group. By extending the combinatorics of…
We consider two kinds of periodicities of mutations in cluster algebras. For any sequence of mutations under which exchange matrices are periodic, we define the associated T- and Y-systems. When the sequence is `regular', they are…
For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, different algorithms for the same clustering task may return…
We give an explicit description of all the exchange relations in any finite type cluster algebra with acyclic initial seed and principal coefficients.
Inspirited by the importance of the spectral theory of graphs, we introduce the spectral theory of valued cluster quiver of a cluster algebra. Our aim is to characterize a cluster algebra via its spectrum so as to use the spectral theory as…
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…
Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…
A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…
Cluster algebras are commutative rings with a set of distinguished generators having a remarkable combinatorial structure. They were introduced by Fomin and Zelevinsky in 2000 in the context of Lie theory, but have since appeared in many…
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…
We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials…
In the acyclic case, we establish a one-to-one correspondence between the tilting objects of the cluster category and the clusters of the associated cluster algebra. This correspondence enables us to solve conjectures on cluster algebras.…
A formula for computing the metric dimension of a simple graph, having no singleton twin, is given. A sufficient condition for a simple graph to have the exchange property, for resolving sets, is found. Some families of power graphs of…
Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural…