A determinantal formula for cluster variables in cluster algebras from surfaces
Javier De Loera

TL;DR
This paper introduces a straightforward determinantal formula for cluster variables in surface-type cluster algebras, simplifying previous combinatorial methods by avoiding perfect matchings enumeration.
Contribution
It presents a novel determinantal approach using the weighted biadjacency matrix, streamlining the computation of cluster variables in surface cluster algebras.
Findings
Determinantal formula simplifies computation of cluster variables
Circumvents complex perfect matchings enumeration
Provides a new algebraic tool for surface cluster algebras
Abstract
For cluster algebras of surface type, Musiker, Schiffler and Williams gave a formula for cluster variables in terms of perfect matchings of snake graphs. Building on this, we provide a simple determinantal formula for cluster variables via the weighted biadjacency matrix of the associated snake graphs, thus circumventing the enumeration of their perfect matchings.
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
TopicsAdvanced Topics in Algebra · advanced mathematical theories · Matrix Theory and Algorithms
