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 thr...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Paul, Pravakar Saikia, Manjil P |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.2408.10273 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2408_10273</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2408_10273</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2408_102733</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjGw0DM0MDI35mSwcFTwyy9LzVFwLCgoyk9MzlAoyVdwzi_NK8nMS1cISC1KS00uUfBNLEnOAAoUK-SnKbgXJRZkFPMwsKYl5hSn8kJpbgZ5N9cQZw9dsB3xBUWZuYlFlfEgu-LBdhkTVgEAtpcy-w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Novel Approach to Counting Perfect Matchings of Graphs</title><source>arXiv.org</source><creator>Paul, Pravakar ; Saikia, Manjil P</creator><creatorcontrib>Paul, Pravakar ; Saikia, Manjil P</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2408.10273</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2408.10273$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2408.10273$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Paul, Pravakar</creatorcontrib><creatorcontrib>Saikia, Manjil P</creatorcontrib><title>A Novel Approach to Counting Perfect Matchings of Graphs</title><description>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.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjGw0DM0MDI35mSwcFTwyy9LzVFwLCgoyk9MzlAoyVdwzi_NK8nMS1cISC1KS00uUfBNLEnOAAoUK-SnKbgXJRZkFPMwsKYl5hSn8kJpbgZ5N9cQZw9dsB3xBUWZuYlFlfEgu-LBdhkTVgEAtpcy-w</recordid><startdate>20240817</startdate><enddate>20240817</enddate><creator>Paul, Pravakar</creator><creator>Saikia, Manjil P</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240817</creationdate><title>A Novel Approach to Counting Perfect Matchings of Graphs</title><author>Paul, Pravakar ; Saikia, Manjil P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2408_102733</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Paul, Pravakar</creatorcontrib><creatorcontrib>Saikia, Manjil P</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Paul, Pravakar</au><au>Saikia, Manjil P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Novel Approach to Counting Perfect Matchings of Graphs</atitle><date>2024-08-17</date><risdate>2024</risdate><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.</abstract><doi>10.48550/arxiv.2408.10273</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2408.10273 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2408_10273 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | A Novel Approach to Counting Perfect Matchings of Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T04%3A23%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Novel%20Approach%20to%20Counting%20Perfect%20Matchings%20of%20Graphs&rft.au=Paul,%20Pravakar&rft.date=2024-08-17&rft_id=info:doi/10.48550/arxiv.2408.10273&rft_dat=%3Carxiv_GOX%3E2408_10273%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |