Combinatorics and Complexity of Partition Functions

Nonfiction, Science & Nature, Mathematics, Combinatorics, Applied
Cover of the book Combinatorics and Complexity of Partition Functions by Alexander Barvinok, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Alexander Barvinok ISBN: 9783319518299
Publisher: Springer International Publishing Publication: March 13, 2017
Imprint: Springer Language: English
Author: Alexander Barvinok
ISBN: 9783319518299
Publisher: Springer International Publishing
Publication: March 13, 2017
Imprint: Springer
Language: English

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. 

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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. 

More books from Springer International Publishing

Cover of the book Robust and Distributed Hypothesis Testing by Alexander Barvinok
Cover of the book Seaside Building Design: Principles and Practice by Alexander Barvinok
Cover of the book James M. Buchanan by Alexander Barvinok
Cover of the book Introduction to Time Series and Forecasting by Alexander Barvinok
Cover of the book Software Engineering by Alexander Barvinok
Cover of the book Research in Computational Molecular Biology by Alexander Barvinok
Cover of the book Scientific Integrity and Research Ethics by Alexander Barvinok
Cover of the book Interactive Collaborative Learning by Alexander Barvinok
Cover of the book The Recovery Myth by Alexander Barvinok
Cover of the book Glutamate and ATP at the Interface of Metabolism and Signaling in the Brain by Alexander Barvinok
Cover of the book Global Nonlinear Dynamics for Engineering Design and System Safety by Alexander Barvinok
Cover of the book Set Theory by Alexander Barvinok
Cover of the book Networked Systems by Alexander Barvinok
Cover of the book Technology Enhanced Assessment by Alexander Barvinok
Cover of the book Sickle Cell Disease and Hematopoietic Stem Cell Transplantation by Alexander Barvinok
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy