Mathematics – Combinatorics
Scientific paper
2005-11-25
Mathematics
Combinatorics
Presented at the 18th International Conference on Formal Power Series and Algebraic Combinatorics. (Revised June 2006: I corre
Scientific paper
This article, based on joint work with Gabriel Carroll, Andy Itsara, Ian Le, Gregg Musiker, Gregory Price, Dylan Thurston, and Rui Viana, presents a combinatorial model based on perfect matchings that explains the symmetries of the numerical arrays that Conway and Coxeter dubbed frieze patterns. This matchings model is a combinatorial interpretation of Fomin and Zelevinsky's cluster algebras of type A. One can derive from the matchings model an enumerative meaning for the Markoff numbers, and prove that the associated Laurent polynomials have positive coefficients as was conjectured (much more generally) by Fomin and Zelevinsky. Most of this research was conducted under the auspices of REACH (Research Experiences in Algebraic Combinatorics at Harvard).
No associations
LandOfFree
The combinatorics of frieze patterns and Markoff numbers 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 The combinatorics of frieze patterns and Markoff numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The combinatorics of frieze patterns and Markoff numbers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-435661