<電子ブック>
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, 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. .
目次 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.
冊子版へのリンク
本文を見る Full text available from SpringerLINK ebooks - Mathematics and Statistics (2016)

詳細

レコードID
主題
SSID
eISBN
登録日 2017.07.11
更新日 2017.11.26