Combinatorics and complexity of partition functions

DOI10.1007/978-3-319-51829-9zbMath1367.05002MaRDI QIDQ511202

Alexander I. Barvinok

Publication date: 14 February 2017

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51829-9

zbMATH Keywords

interpolation; permanents; scaling; correlation decay; hafnians

Mathematics Subject Classification ID

05C31: Graph polynomials

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05A15: Exact enumeration problems, generating functions

05A10: Factorials, binomial coefficients, combinatorial functions

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C45: Eulerian and Hamiltonian graphs