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 Mobile Web and Intelligent Information Systems by Alexander Barvinok
Cover of the book Computer Vision – ECCV 2018 by Alexander Barvinok
Cover of the book Initial Airworthiness by Alexander Barvinok
Cover of the book Advances in Neural Computation, Machine Learning, and Cognitive Research by Alexander Barvinok
Cover of the book Machine Learning and Knowledge Discovery in Databases by Alexander Barvinok
Cover of the book Women's Reproductive Mental Health Across the Lifespan by Alexander Barvinok
Cover of the book Aluminum Stress Adaptation in Plants by Alexander Barvinok
Cover of the book Etiology of Acute Leukemias in Children by Alexander Barvinok
Cover of the book Genetic Diversity and Erosion in Plants by Alexander Barvinok
Cover of the book Autonomous Robotics and Deep Learning by Alexander Barvinok
Cover of the book Gastrointestinal Pharmacology by Alexander Barvinok
Cover of the book Technologies and Innovation by Alexander Barvinok
Cover of the book A Critical Examination of Ethics in Health Care and Biomedical Research by Alexander Barvinok
Cover of the book The Church and the State in France, 1789-1870 by Alexander Barvinok
Cover of the book Financing the Apocalypse 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