Cluster Algebras: Network Science and Machine Learning

This is a first step guide to the theory of cluster algebras. We especially focus on basic notions, techniques, and results concerning seeds, cluster patterns, and cluster algebras.

This is a preliminary draft of Chapters 1-3 of our forthcoming textbook "Introduction to Cluster Algebras." This installment contains: Chapter 1. Total positivity Chapter 2. Mutations of quivers and matrices Chapter 3. Clusters and seeds

For a rooted cluster algebra $\mathcal{A}(Q)$ over a valued quiver $Q$, a \emph{symmetric cluster variable} is any cluster variable belonging to a cluster associated with a quiver $\sigma (Q)$, for some permutation $\sigma$. The subalgebra of $\mathcal{A}(Q)$ generated by all symmetric cluster variables is called the \emph{symmetric mutation subalgebra} and is denoted by $\mathcal{B}(Q)$. In this paper we identify the class of cluster algebras that satisfy $\mathcal{B}(Q)=\ma...

This is a preliminary draft of Chapters 4-5 of our forthcoming textbook "Introduction to Cluster Algebras." Chapters 1-3 have been posted as arXiv:1608.05735. This installment contains: Chapter 4. New patterns from old Chapter 5. Finite type classification

This is a survey article on some connections between cluster algebras and link invariants, written for the Notices of the AMS.

We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model incorporating information about exchange matrices, principal coefficients, g-vectors, and g-vector fans. The idea behind frameworks arises from Cambrian combinatorics and sortable elements, and in this paper, we use sortable elements to construct a fra...

This is an expanded version of the notes of our lectures given at the conference "Current Developments in Mathematics 2003" held at Harvard University on November 21--22, 2003. We present an overview of the main definitions, results and applications of the theory of cluster algebras.

In this paper we give a graph theoretic combinatorial interpretation for the cluster variables that arise in most cluster algebras of finite type. In particular, we provide a family of graphs such that a weighted enumeration of their perfect matchings encodes the numerator of the associated Laurent polynomial while decompositions of the graphs correspond to the denominator. This complements recent work by Schiffler and Carroll-Price for a cluster expansion formula for the A_n...

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 isomorphic with each other, if $\mathcal{A}$ is of finite type excepting types of rank two and type $F_4$, or if $\mathcal{A}$ is of skew-symmetric finite mutation type.

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 prove that the exchange graph does not depend on the coefficients of $\A$. Both conjectures were formulated recently by Fomin and Zelevinsky.