Combinatorics and Complexity of Partition Functions

Views: 7
Downloads: 0
このエントリーをはてなブックマークに追加

Combinatorics and Complexity of Partition Functions

Format:
eBook
Responsibility:
by Alexander Barvinok
Language:
English
Publication info:
Cham, Germany. 2016-. Springer International Publishing,Imprint: Springer
Series:
Algorithms and Combinatorics; 30
Abstract:
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. . Read more
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.
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
Read more
Print Version:

View fulltext

Similar Items:

1
Numerical Semigroups and Applications by Assi, Abdallah; García-Sánchez, Pedro A; SpringerLink
8
Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications by Brazil, Marcus; Zachariasen, Martin; SpringerLink
3
Introduction to Calculus and Classical Analysis by Hijab, Omar; SpringerLink
9
Total Positivity and Its Applications by Gasca, Mariano; Micchelli, Charles A; SpringerLink
4
Asymptotic Expansion of a Partition Function Related to the Sinh-model by Borot, Gat͡an; Guionnet, Alice; Kozlowski, Karol K; SpringerLink
10
Cyber-Physical Systems of Systems : Foundations – A Conceptual Model and Some Derivations: The AMADEOS Legacy by Bondavalli, Andrea; Bouchenak, Sara; Kopetz, Hermann; SpringerLink
11
Information Theory, Combinatorics, and Search Theory : In Memory of Rudolf Ahlswede by Aydinian, Harout; Cicalese, Ferdinando; Deppe, Christian; SpringerLink
6
Computational and Constructive Design Theory by Wallis, W. D; SpringerLink
12
Discrete Calculus : Methods for Counting by Mariconda, Carlo; Tonolo, Alberto; SpringerLink
1.
Numerical Semigroups and Applications by Assi, Abdallah; García-Sánchez, Pedro A; SpringerLink
3.
Introduction to Calculus and Classical Analysis by Hijab, Omar; SpringerLink
4.
Asymptotic Expansion of a Partition Function Related to the Sinh-model by Borot, Gat͡an; Guionnet, Alice; Kozlowski, Karol K; SpringerLink
6.
Computational and Constructive Design Theory by Wallis, W. D; SpringerLink
8.
Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications by Brazil, Marcus; Zachariasen, Martin; SpringerLink
9.
Total Positivity and Its Applications by Gasca, Mariano; Micchelli, Charles A; SpringerLink
10.
Cyber-Physical Systems of Systems : Foundations – A Conceptual Model and Some Derivations: The AMADEOS Legacy by Bondavalli, Andrea; Bouchenak, Sara; Kopetz, Hermann; SpringerLink
11.
Information Theory, Combinatorics, and Search Theory : In Memory of Rudolf Ahlswede by Aydinian, Harout; Cicalese, Ferdinando; Deppe, Christian; SpringerLink
12.
Discrete Calculus : Methods for Counting by Mariconda, Carlo; Tonolo, Alberto; SpringerLink