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 Structural Information and Communication Complexity by Alexander Barvinok
Cover of the book Botswana – A Modern Economic History by Alexander Barvinok
Cover of the book Heterogeneous Information Network Analysis and Applications by Alexander Barvinok
Cover of the book Robust Simulation for Mega-Risks by Alexander Barvinok
Cover of the book Resolving the Gamer’s Dilemma by Alexander Barvinok
Cover of the book Nanomaterials for Sustainable Energy by Alexander Barvinok
Cover of the book The Problem of Time by Alexander Barvinok
Cover of the book The Influence of Uncertainty in a Changing Financial Environment by Alexander Barvinok
Cover of the book The Leadership Hubris Epidemic by Alexander Barvinok
Cover of the book Type-2 Fuzzy Logic and Systems by Alexander Barvinok
Cover of the book Digital Libraries: Knowledge, Information, and Data in an Open Access Society by Alexander Barvinok
Cover of the book Trends in Neurovascular Interventions by Alexander Barvinok
Cover of the book Research Challenges in Modeling and Simulation for Engineering Complex Systems by Alexander Barvinok
Cover of the book Cities and Mega-Cities by Alexander Barvinok
Cover of the book Hardware Protection through Obfuscation 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