1 option
Combinatorics and Complexity of Partition Functions / by Alexander Barvinok.
Springer Nature - Springer Mathematics and Statistics eBooks 2016 English International Available online
View online- Format:
- Book
- Author/Creator:
- Barvinok, Alexander., Author.
- Series:
- Algorithms and Combinatorics, 0937-5511 ; 30
- Language:
- English
- Subjects (All):
- Algorithms.
- Combinatorial analysis.
- Computer science—Mathematics.
- Statistical physics.
- Dynamics.
- Approximation theory.
- Mathematics of Algorithmic Complexity.
- Combinatorics.
- Discrete Mathematics in Computer Science.
- Complex Systems.
- Approximations and Expansions.
- Local Subjects:
- Mathematics of Algorithmic Complexity.
- Combinatorics.
- Discrete Mathematics in Computer Science.
- Complex Systems.
- Algorithms.
- Approximations and Expansions.
- Physical Description:
- 1 online resource (304 pages) : illustrations.
- Edition:
- 1st ed. 2016.
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- Summary:
- 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. .
- 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.
- Notes:
- Includes bibliographical references and index.
- ISBN:
- 3-319-51829-1
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.