Sylvester Zhang (UCLA) - Combinatorics of dimer covers on snake graphs

Abstract: I will discuss the combinatorics of dimer covers (perfect matchings) on snake graphs, including their origins in cluster algebras and the connection to continued fractions. I will then talk about higher-dimensional generalizations based on recent joint works with Ovenhouse, Musiker, and Schiffler.