Higher Dimer Covers on Snake Graphs
Gregg Musiker, Nicholas Ovenhouse, Ralf Schiffler, Sylvester W. Zhang

TL;DR
This paper extends the enumeration of dimer covers on snake graphs to higher dimensions, linking these counts to matrix products and proposing a generalized continued fraction framework with implications for algebraic number theory.
Contribution
It introduces formulas for counting m-dimer covers of snake graphs using higher-dimensional matrix products and explores their connection to generalized continued fractions.
Findings
Number of m-dimer covers equals top-left entry of a product of (m+1)-by-(m+1) matrices.
Established relations between dimer cover enumeration and matrix algebra.
Proposed a new class of generalized continued fractions with potential applications in algebraic number theory.
Abstract
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 is the numerator of the continued fraction . This number is equal to the top left entry of the matrix product . In this paper, we give enumerative results on -dimer covers of snake graphs. We show that the number of -dimer covers of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Commutative Algebra and Its Applications
