Cover Image

Combinatorics and Complexity of Partition Functions

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, hafnia...

Full description

Main Author: Barvinok, Alexander. (Author, http://id.loc.gov/vocabulary/relators/aut)
Corporate Author: SpringerLink (Online service)
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edition:1st ed. 2016.
Series:Algorithms and Combinatorics, 30
Subjects:
Algorithms.
Combinatorics.
Computer science—Mathematics.
Statistical physics.
Dynamical systems.
Approximation theory.
Mathematics of Algorithmic Complexity.
Discrete Mathematics in Computer Science.
Complex Systems.
Approximations and Expansions.
Online Access:https://doi.org/10.1007/978-3-319-51829-9
Table of Contents:
  • 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.

Similar Items