Cluster expansion formulas and perfect matchings
Cluster algebras, introduced in [\textit{S. Fomin} and \textit{A. Zelevinsky}, J. Am. Math. Soc. 15, no. 2, 497--529 (2002; Zbl 1021.16017)], are commutative algebras equipped with a distinguished set of generators, the {cluster variables}. The cluster variables are grouped into sets of constant cardinality \(n\), the {clusters}, and the integer \(n\) is called the {rank} of the cluster algebra. Starting with an initial cluster \(\mathbf{x}\) (together with a skew symmetrizable integer \(n\times n\) matrix \(B=(b_{ij})\) and a coefficient vector \(\mathbf{y}=(y_i)\) whose entries are elements of a torsion--free abelian group \(\mathbb{P}\)) the set of cluster variables is obtained by repeated application of so called {mutations}. To be more precise, let \(\mathcal{F}\) be the field of rational functions in the indeterminates \(x_1,x_2,\ldots,x_n\) over the quotient field of the integer group ring \(\mathbb{ZP}\). Thus \(\mathbf{x}=\{x_1,x_2,\ldots,x_n\}\) is a transcendence basis for \(\mathcal{F}\). For every \(k=1,2,\ldots,n\), the mutation \(\mu_k(\mathbf{x})\) of the cluster \(\mathbf{x}=\{x_1,x_2,\ldots,x_n\}\) is a new cluster \(\mu_k(\mathbf{x})=\mathbf{x}\setminus \{x_k\}\cup\{x_k'\}\) obtained from \(\mathbf{x}\) by replacing the cluster variable \(x_k\) by the new cluster variable \[ x_k'= \frac{1}{x_k}\,\left(y_k^+\,\prod_{b_{ki}>0} x_i^{b_{ki}} + y_k^-\,\prod_{b_{ki}<0} x_i^{-b_{ki}}\right) \] in \(\mathcal{F}\), where \(y_k^+,y_k^-\) are certain monomials in \(y_1,y_2,\ldots,y_n\). Mutations also change the attached matrix \(B\) as well as the coefficient vector \(\mathbf{y}\). The set of all cluster variables is the union of all clusters obtained from an initial cluster \(\mathbf{x}\) by repeated mutations. It follows from the construction that every cluster variable is a rational function in the initial cluster variables \(x_1,x_2,\ldots,x_n\). In S. Fomin and A. Zelevinsky [loc. cit.], it is shown that every cluster variable \(u\) is actually a Laurent polynomial in the \(x_i\), that is, \(u\) can be written as a reduced fraction \[ u=\frac{f(x_1,x_2,\ldots,x_n)}{\prod_{i=1}^n x_i^{d_i}}, \] where \(f\in\mathbb{ZP}[x_1,x_2,\ldots,x_n]\) and \(d_i\geq 0\). The right hand side of this equation is called the {cluster expansion} of \(u\) in \(\mathbf{x}\). The cluster algebra is determined by the initial matrix \(B\) and the choice of the coefficient system. A canonical choice of coefficients is the principal coefficient system, introduced in [\textit{S. Fomin} and \textit{A. Zelevinsky}, Compos. Math. 143, No. 1, 112--164 (2007; Zbl 1127.16023)], which means that the coefficient group \(\mathbb{P}\) is the free abelian group on \(n\) generators \(y_1,y_2,\ldots,y_n\), and the initial coefficient tuple \(\mathbf{y}=\{y_1,y_2,\ldots,y_n\}\) consists of these \(n\) generators. Note that knowing the expansion formulas in the case where the cluster algebra has principal coefficients allows one to compute the expansion formulas for arbitrary coefficient systems. In the landmark paper [\textit{S. Fomin}, \textit{M. Shapiro} and \textit{D. Thurston}, Acta Math. 201, No. 1, 83--146 (2008; Zbl 1263.13023)], the authors initiated a systematic study of the cluster algebras arising from triangulations of a surface with boundary and marked points. In this approach, cluster variables in the cluster algebra correspond to arcs in the surface, and clusters correspond to triangulations. Note that this model was used to give a direct expansion formula for cluster variables in cluster algebras associated to unpunctured surfaces, with arbitrary coefficients, in terms of certain paths on the triangulation. In the paper under review, the authors study cluster algebras with principal coefficient systems associated to unpunctured surfaces. They give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect matchings of a certain weighted graph that is constructed from the surface by recursive glueing of elementary pieces called tiles. To be more precise, let \(x_\gamma\) be a cluster variable corresponding to an arc \(\gamma\) in the unpunctured surface and let \(d\) be the number of crossings between \(\gamma\) and the triangulation \(T\) of the surface. Then \(\gamma\) runs through \(d+1\) triangles of \(T\) and each pair of consecutive triangles forms a quadrilateral which is called a tile. So they obtain \(d\) tiles, each of which is a weighted graph, whose weights are given by the cluster variables \(x_\tau\) associated to the arcs \(\tau\) of the triangulation \(T\). Then they obtain a weighted graph \(G_{T,\gamma}\) by glueing the \(d\) tiles in a specific way and then deleting the diagonal in each tile. To any perfect matching \(P\) of this graph one can associate its weight \(w(P)\) which is the product of the weights of its edges, hence a product of cluster variables. They prove the following cluster expansion formula: Theorem 3.1. \[ x_\gamma = \sum_P \frac{w(P)\,y(P)}{x_{i_1}x_{i_2}\ldots x_{i_d}}, \] where the sum is over all perfect matchings \(P\) of \(G_{T,\gamma}\), \(w(P)\) is the weight of \(P\), and \(y(P)\) is a monomial in \(\mathbf{y}\). They also give a formula for the coefficients \(y(P)\) in terms of perfect matchings. There are two corresponding matchings which are the unique two matchings that have all their edges on the boundary of the graph \(G_{T,\gamma}\). Denote by \(P_-\) the one with \(y(P_-)=1\) and the other by \(P_+\). Now, for an arbitrary perfect matching \(P\), the coefficient \(y(P)\) is determined by the set of edges of the symmetric difference \(P_-\ominus P =(P_-\cup P)\setminus (P_-\cap P)\) as follows. Theorem 5.1. The set \(P_-\ominus P\) is the set of boundary edges of a (possibly disconnected) subgraph \(G_P\) of \(G_{T,\gamma}\) which is a union of tiles \( G_P =\bigcup_{j\in J} S_j. \) Moreover, \[ y(P)=\prod_{j\in J} y_{i_j}. \] The third main result of this paper is yet another description of the formula of Theorem 3.1 in terms of the graph \(G_{T,\gamma}\) only. In order to state this result, we need some notation. If \(H\) is a graph, let \(c(H)\) be the number of connected components of \(H\), let \(E(H)\) be the set of edges of \(H\), and denote by \(\partial H\) the set of boundary edges of \(H\). Define \(\mathcal{H}_k\) to be the set of all subgraphs \(H\) of \(G_{T,\gamma}\) such that \(H\) is a union of \(k\) tiles \(H=S_{j_1}\cup\cdots\cup S_{j_k}\) and such that the number of edges of \(P_-\) that are contained in \(H\) is equal to \(k+c(H)\). For \(H\in \mathcal{H}_k\), let \(y(H)=\prod_{S_{i_j} \text{\,tile\,in\,}H} y_{i_j}.\) Theorem 6.1. The cluster expansion of the cluster variable \(x_\gamma\) is given by \[ x_\gamma=\sum_{k=0}^d \;\sum_{H\in \mathcal{H}_k} \frac{w(\partial H\ominus P_-)\,y(H)}{x_{i_1} x_{i_2}\cdots x_{i_d}}. \] It is worth pointing out that, in a sequel to the present paper [\textit{G. Musiker}, \textit{R. Schiffler} and \textit{L. Williams}, Adv. Math. 227, No. 6, 2241--2308 (2011; Zbl 1331.13017)], the authors give expansion formulas for the cluster variables in cluster algebras from arbitrary surfaces (allowing punctures) and prove the positivity conjecture for these cluster algebras.
scientific article; zbMATH DE number 5824573