In 2000, S. Fomin and A. Zelevinsky introduced Cluster Algebras as abstractions of a combinatoro-algebraic phenomenon that is found in many different areas throughout mathematics. Defined as a sub-algebra of the ambient field of rational functions in finitely many variables, it is generated by union of cluster variables. The cluster variables are distributed across clusters. The clusters arise from an original "seed'' by a process known as mutation. For example, given a regular polygon with n sides the triangulations of this polygon with non-crossing diagonals can be obtained from a given triangulation of this type by a sequence of diagonal flips. Combinatorial data at a given cluster may be defined in terms of a quiver or alternatively a skew-symmetric matrix and using this quiver or matrix, the other clusters may be obtained by mutations. The clusters can be visualized as a graph with vertices being the clusters and edges being the mutations.As it turns out the coordinate rings of Gr...
