Snake graph calculus and cluster algebras from surfaces
classification
🧮 math.RT
math.CO
keywords
clustersnakealgebrasgraphgraphsrelationssurfacesvariable
read the original abstract
Snake graphs appear naturally in the theory of cluster algebras. For cluster algebras from surfaces, each cluster variable is given by a formula which is parametrized by the perfect matchings of a snake graph. In this paper, we identify each cluster variable with its snake graph, and interpret relations among the cluster variables in terms of these graphs. In particular, we give a new proof of skein relations of two cluster variables.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.