Higher dimer covers on snake graphs

Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer covers (or perfect matchings) of snake graphs. Moreover, the enumeration of 1-dimer covers of snake graphs provides a combinatorial interpretation of continued fractions. In particular, the number of 1-dimer covers of the snake graph G[a1, . . ., an] is the numerator of the continued fraction [a1, . . ., an]. This number is equal to the top left entry of the matrix product ^(a₁^{1 1}₀⁾ · · · ^(a₁ⁿ¹₀⁾. In this paper, we give enumerative results on m-dimer covers of snake graphs. We show that the number of m-dimer covers of the snake graph G[a1, . . ., an] is the top left entry of a product of analogous (m + 1)-by-(m + 1) matrices. We discuss how our enumerative results are related to other known combinatorial formulas, and we suggest a generalization of continued fractions based on our methods. These generalized continued fractions provide some interesting open questions and a possibly novel approach towards Hermite’s problem for cubic irrationals.