Cluster Expansion Formulas and Perfect Matchings
نویسندگان
چکیده
We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect matchings of a certain graph GT,γ that is constructed from the surface by recursive glueing of elementary pieces that we call tiles. We also give a second formula for these Laurent polynomial expansions in terms of subgraphs of the graph GT,γ .
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کامل0 O ct 2 00 8 CLUSTER EXPANSION FORMULAS AND PERFECT MATCHINGS
We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect matchings of a certain graph GT,γ that is constructed from the surface by recursive glueing of elementary pieces that we call tiles. We also give a second formula...
متن کاملBipartite Graphs, Quivers, and Cluster Variables
We explore connections between formulas for certain combinatorial and algebraic objects. In particular, given a planar bipartite graph G, we consider the cluster algebra A corresponding to a quiver obtained from its dual graph. We then obtain formulas for certain cluster variables in A in terms of perfect matchings of subgraphs of G. Such subgraphs look like trees; locally they look like snakes...
متن کاملPerfect Matchings and Cluster Algebras of Classical Type
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 rec...
متن کاملBEYOND AZTEC CASTLES: TORIC CASCADES IN THE dP3 QUIVER
Given a super-symmetric quiver gauge theory, string theorists can associate a corresponding toric variety (which is a cone over a Calabi-Yau 3-fold) as well as an associated combinatorial model known as a brane tiling. In combinatorial language, a brane tiling is a bipartite graph on a torus and its perfect matchings are of interest to both combinatorialists and physicists alike. A cluster alge...
متن کامل