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 Egyptian Coastal Lakes and Wetlands: Part II by Alexander Barvinok
Cover of the book Visualization of Conventional and Combusting Subsonic Jet Instabilities by Alexander Barvinok
Cover of the book Hope for a Good Life by Alexander Barvinok
Cover of the book The Biogeochemical Impacts of Forests and the Implications for Climate Change Mitigation by Alexander Barvinok
Cover of the book Revising the APA Ethics Code by Alexander Barvinok
Cover of the book Intelligent Information and Database Systems by Alexander Barvinok
Cover of the book Algorithms in Bioinformatics by Alexander Barvinok
Cover of the book Ethnomathematics and its Diverse Approaches for Mathematics Education by Alexander Barvinok
Cover of the book Software Engineering Trends and Techniques in Intelligent Systems by Alexander Barvinok
Cover of the book Democracy under Threat by Alexander Barvinok
Cover of the book Interdisciplinary Approaches to Pedagogy and Place-Based Education by Alexander Barvinok
Cover of the book ASA S3/SC1.4 TR-2014 Sound Exposure Guidelines for Fishes and Sea Turtles: A Technical Report prepared by ANSI-Accredited Standards Committee S3/SC1 and registered with ANSI by Alexander Barvinok
Cover of the book Engineering of Biomaterials by Alexander Barvinok
Cover of the book Metastability by Alexander Barvinok
Cover of the book Grammatical Inference 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