{"id":"https://openalex.org/W7163415600","doi":"https://doi.org/10.48550/arxiv.2606.03975","title":"Planar Perfect Matching Counting is as Hard as Determinants","display_name":"Planar Perfect Matching Counting is as Hard as Determinants","publication_year":2026,"publication_date":"2026-06-02","ids":{"openalex":"https://openalex.org/W7163415600","doi":"https://doi.org/10.48550/arxiv.2606.03975"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.03975","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.03975","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080255734","display_name":"Radu Curticapean","orcid":"https://orcid.org/0000-0001-7201-9905"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Curticapean, Radu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137770494","display_name":"Jiaheng Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Jiaheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.7239000201225281,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.7239000201225281,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.1193000003695488,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.04859999939799309,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.515500009059906},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4887000024318695},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4885999858379364},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.43720000982284546},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4359000027179718},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43560001254081726},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4336000084877014},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.41370001435279846},{"id":"https://openalex.org/keywords/perfect-power","display_name":"Perfect power","score":0.41179999709129333}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7444000244140625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5586000084877014},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5376999974250793},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4887000024318695},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4885999858379364},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.43720000982284546},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4359000027179718},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43560001254081726},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4336000084877014},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C93446932","wikidata":"https://www.wikidata.org/wiki/Q1972803","display_name":"Perfect power","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37869998812675476},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.3662000000476837},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.35190001130104065},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.3467999994754791},{"id":"https://openalex.org/C2778401447","wikidata":"https://www.wikidata.org/wiki/Q7140637","display_name":"Partition function (quantum field theory)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3158000111579895},{"id":"https://openalex.org/C83581934","wikidata":"https://www.wikidata.org/wiki/Q527381","display_name":"Arbitrary-precision arithmetic","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C3746008","wikidata":"https://www.wikidata.org/wiki/Q981351","display_name":"Symmetric function","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.2554999887943268},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.03975","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.03975","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,13,17,42,56,62,73,94,130],"1960s,":[2],"Fisher,":[3],"Kasteleyn":[4],"and":[5,107],"Temperley":[6],"designed":[7],"an":[8,67,142],"ingenious":[9],"algorithm":[10,39,68,75],"for":[11,22,44],"computing":[12],"partition":[14],"function":[15],"of":[16,58,132],"dimer":[18],"model,":[19],"or":[20],"equivalently,":[21],"counting":[23,59],"perfect":[24,81,113],"matchings":[25,82,114],"in":[26,83,115,124],"edge-weighted":[27,80,116,143],"planar":[28,84,118],"graphs":[29,86,119],"(Philos.":[30],"Mag.":[31],"1961;":[32],"J.":[33,51],"Mathematical":[34],"Phys.":[35],"1963).":[36],"This":[37,128],"FKT":[38,74],"later":[40],"became":[41],"foundation":[43],"Valiant's":[45],"holographic":[46],"algorithms":[47],"(FOCS":[48,71],"2004;":[49],"SIAM":[50],"Comput.":[52],"2008),":[53,72],"which":[54],"motivated":[55],"study":[57],"problems":[60],"under":[61],"Holant":[63],"framework.":[64],"Combined":[65],"with":[66,87],"by":[69],"Yuster":[70],"allows":[76],"us":[77],"to":[78],"count":[79],"$n$-vertex":[85,117],"$\\tilde{O}(n^{\u03c9/2})$":[88],"arithmetic":[89,126],"operations,":[90],"where":[91],"$\u03c9<2.372$":[92],"is":[93,141],"matrix":[95],"multiplication":[96],"exponent.":[97],"We":[98],"prove":[99],"a":[100],"corresponding":[101],"lower":[102],"bound:":[103],"Over":[104],"algebraic":[105],"circuits":[106],"other":[108],"sufficiently":[109],"strong":[110],"computational":[111],"models,":[112],"$G$":[120,140],"cannot":[121],"be":[122],"counted":[123],"$O(n^{\u03c9/2-\u03b5})$":[125],"operations.":[127],"confirms":[129],"optimality":[131],"Yuster's":[133],"algorithm.":[134],"Our":[135],"bound":[136],"holds":[137],"even":[138],"when":[139],"square":[144],"grid.":[145]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-04T00:00:00"}