2024/08/17 by Pravakar Paul, Paul, Pravakar, Manjil P. Saikia +1
Computer Science · #05C70 #18A10 #52C20 #Advanced Graph Theory Research #Combinatorics (math.CO) #Data Management and Algorithms #FOS: Mathematics #Graph Theory and Algorithms #Primary 05C30 #Secondary 05A15
paper · pdf · doi:10.48550/arxiv.2408.10273
openalex publication_date 2024/08/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.