A Novel Approach to Counting Perfect Matchings of Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910570920280064 |
|---|---|
| author | Paul, Pravakar Saikia, Manjil P. |
| author_facet | Paul, Pravakar Saikia, Manjil P. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_10273 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Novel Approach to Counting Perfect Matchings of Graphs Paul, Pravakar Saikia, Manjil P. Combinatorics Primary 05C30, Secondary 05A15, 05C70, 18A10, 52C20 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. |
| title | A Novel Approach to Counting Perfect Matchings of Graphs |
| topic | Combinatorics Primary 05C30, Secondary 05A15, 05C70, 18A10, 52C20 |
| url | https://arxiv.org/abs/2408.10273 |