Cluster algebras and continued fractions

Abstract

We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To a continued fraction $[a_1,a_2,\dots ,a_n]$, we associate a snake graph $\mathcal{G}[a_1,a_2,\dots ,a_n]$ such that the continued fraction is the quotient of the number of perfect matchings of $\mathcal{G}[a_1,a_2,\dots ,a_n]$ and $\mathcal{G}[a_2,\dots ,a_n]$. We also show that snake graphs are in bijection with continued fractions. We then apply this connection between cluster algebras and continued fractions in two directions. First, we use results from snake graph calculus to obtain new identities for the continuants of continued fractions. Then, we apply the machinery of continued fractions to cluster algebras and obtain explicit direct formulas for quotients of elements of the cluster algebra as continued fractions of Laurent polynomials in the initial variables. Building on this formula, and using classical methods for infinite periodic continued fractions, we also study the asymptotic behavior of quotients of elements of the cluster algebra.

28 pages, Extended introduction and bibliography

References in corpus (2)

• Snake graph calculus and cluster algebras from surfaces III: Band graphs and snake rings
• Mutation of friezes

Cited by in corpus (18)

• How tropical are seven- and eight-particle amplitudes?
• Singularities of eight- and nine-particle amplitudes from cluster algebras and tropical geometry
• The SAGEX Review on Scattering Amplitudes, Chapter 5: Analytic Bootstraps for Scattering Amplitudes and Beyond
• A combinatorial approach to scattering diagrams
• Expansion Posets for Polygon Cluster Algebras
• Lattice bijections for string modules, snake graphs and the weak Bruhat order
• Cluster variables, ancestral triangles and Alexander polynomials
• Linear extensions and continued fractions
• Relation between $f$-vectors and $d$-vectors in cluster algebras of finite type or rank 2
• Computational complexity of counting coincidences
• Cluster algebras and binary subwords
• Cluster Algebras and the HOMFLY Polynomial
• F-polynomial formula from continued fractions
• $q$-Rational and $q$-Real Binomial Coefficients
• A Generalization of Markov Numbers
• Hernandez-Leclerc modules and snake graphs
• Plabic Tangles and Cluster Promotion Maps
• Counting Subwords Occurrences in Base-b Expansions