Snake graph calculus and cluster algebras from surfaces. II: Self-crossing snake graphs

From MaRDI portal
Publication:495572

DOI10.1007/S00209-015-1475-YzbMATH Open1375.13029arXiv1407.0500OpenAlexW1846916865MaRDI QIDQ495572FDOQ495572


Authors: Ilke Canakci, Ralf Schiffler Edit this on Wikidata


Publication date: 14 September 2015

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

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 continue our study of snake graphs from a combinatorial point of view. We introduce the notions of abstract snake graphs and abstract band graphs, their crossings and self-crossings, as well as the resolutions of these crossings. We show that there is a bijection between the set of perfect matchings of (self-)crossing snake graphs and the set of perfect matchings of the resolution of the crossing. In the situation where the snake and band graphs are coming from arcs and loops in a surface without punctures, we obtain a new proof of skein relations in the corresponding cluster algebra.


Full work available at URL: https://arxiv.org/abs/1407.0500




Recommendations



Cites Work


Cited In (28)





This page was built for publication: Snake graph calculus and cluster algebras from surfaces. II: Self-crossing snake graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495572)