{"id":"https://openalex.org/W7207798145","doi":"https://doi.org/10.48550/arxiv.2609.02017","title":"Optimal girth-dependent bounds for the Bethe approximation of the permanent","display_name":"Optimal girth-dependent bounds for the Bethe approximation of the permanent","publication_year":2026,"publication_date":"2026-09-02","ids":{"openalex":"https://openalex.org/W7207798145","doi":"https://doi.org/10.48550/arxiv.2609.02017"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.02017","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02017","pdf_url":"https://arxiv.org/pdf/2609.02017","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,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.02017","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054551001","display_name":"Dingding Dong","orcid":"https://orcid.org/0000-0001-8500-2897","observed_orcids":["https://orcid.org/0000-0001-8500-2897"]},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dong, Dingding","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science , University of Illinois Chicago , Chicago , IL 60607 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science , University of Illinois Chicago , Chicago , IL 60607 , USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017261510","display_name":"Vishesh Jain","orcid":"https://orcid.org/0000-0002-7275-3218","observed_orcids":["https://orcid.org/0000-0002-7275-3218"]},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jain, Vishesh","raw_affiliation_strings":["Department of Mathematics , California Institute of Technology , Pasadena , CA 91125 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , California Institute of Technology , Pasadena , CA 91125 , USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9463000297546387,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9463000297546387,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.024000000208616257,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.009499999694526196,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/permanent","display_name":"permanent","score":0.7680000066757202},{"id":"https://openalex.org/keywords/girth","display_name":"girth","score":0.4729999899864197},{"id":"https://openalex.org/keywords/nonnegative-matrices","display_name":"nonnegative matrices","score":0.5550000071525574},{"id":"https://openalex.org/keywords/cycle-graphs","display_name":"cycle graphs","score":0.4009999930858612}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8226000070571899},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7825000286102295},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7818999886512756},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.7534999847412109},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6100999712944031},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5910000205039978},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5748999714851379},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4830000102519989},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45730000734329224},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4514000117778778},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42890000343322754},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.359499990940094},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.34540000557899475},{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.32659998536109924},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C62555958","wikidata":"https://www.wikidata.org/wiki/Q6042601","display_name":"Integer matrix","level":5,"score":0.28700000047683716},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.27880001068115234},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26080000400543213}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.02017","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02017","pdf_url":"https://arxiv.org/pdf/2609.02017","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,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.02017","doi":"https://doi.org/10.48550/arxiv.2609.02017","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.02017","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,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.02017","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02017","pdf_url":"https://arxiv.org/pdf/2609.02017","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,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7207798145.pdf","grobid_xml":"https://content.openalex.org/works/W7207798145.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1594620223","https://openalex.org/W3105831715","https://openalex.org/W7204805534","https://openalex.org/W7204916796"],"related_works":["https://openalex.org/W4379539378","https://openalex.org/W4386075097","https://openalex.org/W2899996831","https://openalex.org/W7204916796","https://openalex.org/W7204805534","https://openalex.org/W2161055874","https://openalex.org/W2198291345","https://openalex.org/W1995854161","https://openalex.org/W7125768608","https://openalex.org/W4310901894"],"abstract_inverted_index":{"For":[0],"an":[1,64,88],"$n\\times":[2],"n$":[3],"nonnegative":[4],"matrix":[5,50,108],"$A$,":[6],"the":[7,18,48,69,78,106],"Bethe":[8],"permanent,":[9],"which":[10],"is":[11,33,45,103],"computable":[12],"in":[13],"deterministic":[14],"polynomial":[15],"time,":[16],"satisfies":[17],"tight":[19],"universal":[20],"comparison":[21],"\\[\\operatorname{Bethe}(A)":[22,95],"\\leq":[23,25,96,98],"\\operatorname{per}(A)":[24,97],"2^{n/2}\\operatorname{Bethe}(A).\\]":[26],"The":[27,37,100],"lower":[28],"bound,":[29,39],"due":[30,40],"to":[31,41],"Gurvits,":[32],"attained":[34,46,104],"on":[35],"forests.":[36],"upper":[38,101],"Anari":[42],"and":[43],"Rezaei,":[44],"by":[47,105],"adjacency":[49,107],"of":[51,55,60,68,82,109,113],"a":[52,58,110],"disjoint":[53,111],"union":[54,112],"$4$-cycles.":[56],"Confirming":[57],"conjecture":[59],"Anari,":[61],"we":[62,74],"provide":[63],"optimal":[65],"girth-dependent":[66],"refinement":[67],"above":[70],"comparison.":[71],"More":[72],"precisely,":[73],"show":[75],"that":[76],"if":[77],"bipartite":[79],"support":[80],"graph":[81],"$A$":[83],"has":[84],"girth":[85],"at":[86],"least":[87],"even":[89],"integer":[90],"$g":[91],"\\geq":[92],"4$,":[93],"then":[94],"2^{2n/g}\\operatorname{Bethe}(A).\\]":[99],"bound":[102],"$g$-cycles.":[114]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-04T00:00:00"}