TY  - BOOK
AU  - Barvinok,Alexander
ED  - SpringerLink (Online service)
TI  - Combinatorics and Complexity of Partition Functions
T2  - Algorithms and Combinatorics,
SN  - 9783319518299
AV  - QA9.58 
U1  - 511.352 23
PY  - 2016///
CY  - Cham
PB  - Springer International Publishing, Imprint: Springer
KW  - Combinatorics
KW  - Computational complexity
KW  - Algorithms
KW  - Mathematics
KW  - Mathematics of Algorithmic Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Complex Systems
KW  - Approximations and Expansions
N1  - Chapter I. Introduction -- Chapter II. Preliminaries -- Chapter III. Permanents -- Chapter IV. Hafnians and Multidimensional Permanents -- Chapter V. The Matching Polynomial -- Chapter VI. The Independence Polynomial -- Chapter VII. The Graph Homomorphism Partition Function -- Chapter VIII. Partition Functions of Integer Flows -- References -- Index
N2  - Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnians and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems. The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates.
UR  - https://doi.org/10.1007/978-3-319-51829-9
ER  -