A graph theoretic expansion formula for cluster algebras of classical type

Details A graph theoretic expansion formula for cluster algebras of classical type A graph theoretic expansion formula for cluster algebras of classical type

2007-10-18

arxiv.org/abs/0710.3574v2

Mathematics

Combinatorics

32 pages, 14 figures

Scientific paper

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 case while providing a novel interpretation for the B_n, C_n, and D_n cases.

Affiliated with

Also associated with

No associations

Rating

A graph theoretic expansion formula for cluster algebras of classical type does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A graph theoretic expansion formula for cluster algebras of classical type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A graph theoretic expansion formula for cluster algebras of classical type will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-461666