Snake graph calculus and cluster algebras from surfaces (Q2437448): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q495571
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Ilke Canakci / rank
 
Normal rank

Revision as of 08:33, 15 February 2024

scientific article
Language Label Description Also known as
English
Snake graph calculus and cluster algebras from surfaces
scientific article

    Statements

    Snake graph calculus and cluster algebras from surfaces (English)
    0 references
    0 references
    0 references
    3 March 2014
    0 references
    Cluster algebras were introduced by \textit{S. Fomin} and \textit{A. Zelevinsky} [J. Am. Math. Soc. 15, No. 2, 497--529 (2002; Zbl 1021.16017)], motivated by combinatorial aspects of canonical bases in Lie theory. They are commutative algebras, whose generators and relations are constructed by a recursive process. This distinguished set of generators, called the cluster variables, are collected into groups of \(n\) elements called \textit{clusters} connected by local transition rules. By construction, cluster variables are Laurent polynomials with integer coefficients. Moreover, these coefficients are conjectured to be positive. This positivity conjecture was proved for a large class of cluster algebras that are constructed from triangulations of surfaces, by Musiker, Shiffler and Williams [\textit{G. Musiker} et al., Adv. Math. 227, No. 6, 2241--2308 (2011; Zbl 1331.13017)]. The proof uses a direct combinatorial formula for the cluster variables. This formula is parametrized by perfect matchings of so-called \textit{snake graphs}, which are originally constructed from arcs on the surface. A snake graph is a connected graph consisting of a finite sequence of square tiles each sharing exactly one edge whose configuration depends on the arc. Hence, it makes sense to say that two snake graphs are crossing when the corresponding arcs are crossing. Also, one can define the \textit{resolution} of two crossing snake graphs, as the pair of snake graphs associated with the resolution of the two crossing arcs. The aim of this article is to develop the notion of abstract snake graphs which are not necessarily related to arcs on a surface. The authors give a combinatorial definition of snake graphs and define combinatorially what it means for two abstract snake graph to cross, and how to construct the resolution of this crossing as a new pair of snake graphs. When the abstract snake graphs are usual snake graphs and come from arcs on a surface, they prove that the notions of crossing and resolution coincide.
    0 references
    cluster algebras
    0 references
    cluster algebras from surfaces
    0 references
    snake graphs
    0 references
    perfect matchings
    0 references
    Skein relations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references