{"id":"https://openalex.org/W2139974605","doi":"https://doi.org/10.1017/s0963548311000435","title":"Computing the Partition Function for Perfect Matchings in a Hypergraph","display_name":"Computing the Partition Function for Perfect Matchings in a Hypergraph","publication_year":2011,"publication_date":"2011-10-17","ids":{"openalex":"https://openalex.org/W2139974605","doi":"https://doi.org/10.1017/s0963548311000435","mag":"2139974605"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548311000435","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548311000435","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/7FA9E23309FACC75AFB6B0216E9B4CE4/S0963548311000435a.pdf/div-class-title-computing-the-partition-function-for-perfect-matchings-in-a-hypergraph-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/7FA9E23309FACC75AFB6B0216E9B4CE4/S0963548311000435a.pdf/div-class-title-computing-the-partition-function-for-perfect-matchings-in-a-hypergraph-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082996804","display_name":"Alexander Barvinok","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ALEXANDER BARVINOK","raw_affiliation_strings":["Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1043, USA (e-mail:","Department of mathematics, university of michigan, ann arbor, mi 48109-1043, usa (e-mail: barvinok@umich.edu)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1043, USA (e-mail:","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Department of mathematics, university of michigan, ann arbor, mi 48109-1043, usa (e-mail: barvinok@umich.edu)","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004360801","display_name":"Alex Samorodnitsky","orcid":"https://orcid.org/0000-0001-8643-7948"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"ALEX SAMORODNITSKY","raw_affiliation_strings":["Department of Computer Science, Hebrew University of Jerusalem, Givat Ram Campus, 91904, Israel (e-mail:","Department of computer science, hebrew university of jerusalem, givat ram campus, 91904, israel (e-mail: salex@cs.huji.ac.il)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hebrew University of Jerusalem, Givat Ram Campus, 91904, Israel (e-mail:","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"Department of computer science, hebrew university of jerusalem, givat ram campus, 91904, israel (e-mail: salex@cs.huji.ac.il)#TAB#","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5129,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90273577,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"6","first_page":"815","last_page":"835"},"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.9997000098228455,"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.9997000098228455,"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.9957000017166138,"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.9945999979972839,"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/van-der-waerdens-theorem","display_name":"Van der Waerden's theorem","score":0.9385023713111877},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.881822943687439},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8145333528518677},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7868454456329346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6868342161178589},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6274412870407104},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5407317876815796},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5087962746620178},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5078132748603821},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.48578977584838867},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4659487009048462},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44002673029899597},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4166209399700165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16310954093933105}],"concepts":[{"id":"https://openalex.org/C116493835","wikidata":"https://www.wikidata.org/wiki/Q764287","display_name":"Van der Waerden's theorem","level":2,"score":0.9385023713111877},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.881822943687439},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8145333528518677},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7868454456329346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6868342161178589},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6274412870407104},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5407317876815796},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5087962746620178},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5078132748603821},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.48578977584838867},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4659487009048462},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44002673029899597},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4166209399700165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16310954093933105},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548311000435","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548311000435","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/7FA9E23309FACC75AFB6B0216E9B4CE4/S0963548311000435a.pdf/div-class-title-computing-the-partition-function-for-perfect-matchings-in-a-hypergraph-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0963548311000435","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548311000435","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/7FA9E23309FACC75AFB6B0216E9B4CE4/S0963548311000435a.pdf/div-class-title-computing-the-partition-function-for-perfect-matchings-in-a-hypergraph-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7539307365","display_name":"Combinatorics, Geometry, and Algorithms","funder_award_id":"0856640","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8462825307","display_name":null,"funder_award_id":"DMS 0856640","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2139974605.pdf","grobid_xml":"https://content.openalex.org/works/W2139974605.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1588434395","https://openalex.org/W1632601927","https://openalex.org/W1967139274","https://openalex.org/W1982321501","https://openalex.org/W1988229094","https://openalex.org/W2006912660","https://openalex.org/W2027584441","https://openalex.org/W2033738503","https://openalex.org/W2039611200","https://openalex.org/W2053695612","https://openalex.org/W2077538470","https://openalex.org/W2079848585","https://openalex.org/W2089683364","https://openalex.org/W2097618259","https://openalex.org/W2104801933","https://openalex.org/W2146774612","https://openalex.org/W2161611531","https://openalex.org/W2401610261","https://openalex.org/W2610680804","https://openalex.org/W2951666291","https://openalex.org/W2963345594","https://openalex.org/W3098068881","https://openalex.org/W4240416043","https://openalex.org/W6669757751"],"related_works":["https://openalex.org/W2391021702","https://openalex.org/W1987972399","https://openalex.org/W2890157477","https://openalex.org/W2033895221","https://openalex.org/W2025456998","https://openalex.org/W2953008743","https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W3089158720","https://openalex.org/W2258625997"],"abstract_inverted_index":{"Given":[0],"non-negative":[1],"weights":[2,53],"w":[3,24,28,54],"S":[4,9,25,29,36,41,48,55],"on":[5],"the":[6,19,22,52,77,86,93],"k":[7,46],"-subsets":[8,47],"of":[10,21,63,92,108],"a":[11,60,71,80],"km":[12],"-element":[13],"set":[14],"V":[15,34],",":[16],"we":[17,69,88],"consider":[18],"sum":[20,78],"products":[23],"1":[26,37],"\u22c5\u22c5\u22c5":[27,39],"m":[30,42,83],"over":[31],"all":[32],"partitions":[33],"=":[35],"\u222a":[38,40],"into":[43],"pairwise":[44],"disjoint":[45],"i":[49],".":[50],"When":[51],"are":[56],"positive":[57],"and":[58,97,110],"within":[59,79],"constant":[61],"factor":[62],"each":[64],"other,":[65],"fixed":[66],"in":[67,82,114],"advance,":[68],"present":[70],"simple":[72],"polynomial-time":[73],"algorithm":[74],"to":[75,106],"approximate":[76],"polynomial":[81],"factor.":[84],"In":[85],"process,":[87],"obtain":[89],"higher-dimensional":[90],"versions":[91],"van":[94],"der":[95],"Waerden":[96],"Bregman\u2013Minc":[98],"bounds":[99],"for":[100],"permanents.":[101],"We":[102],"also":[103],"discuss":[104],"applications":[105],"counting":[107],"perfect":[109,112],"nearly":[111],"matchings":[113],"hypergraphs.":[115]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}