A Novel Approach to Counting Perfect Matchings of Graphs
Combinatorics
2024-08-21 v1
Abstract
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.
Cite
@article{arxiv.2408.10273,
title = {A Novel Approach to Counting Perfect Matchings of Graphs},
author = {Pravakar Paul and Manjil P. Saikia},
journal= {arXiv preprint arXiv:2408.10273},
year = {2024}
}
Comments
22 pages, 16 figures, comments are welcome