Let A be a gentle algebra. It is given by a quiver (directed graph) and 0-relations (non-admissible directed paths). The indecomposable modules of A are determined by the combinatorics of undirected walks on the quiver. So every module admits a

Abstract: The dimer model is a statistical mechanics model that studies random perfect matchings on graphs. It was introduced in the 1960s, when the partition functions and correlations were exactly computed by Kasteleyn, Temperley, and Fisher. Over the past few