A Novel Approach to Counting Perfect Matchings of Graphs

We build a new perspective to count perfect matchings of a given graph. This idea is motivated by a construction on the relative cohomology group of surfaces. As an application of our theory, we reprove the celebrated Aztec Diamond theorem, and show how alternating sign matrices naturally arises through this framework.