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 International Congress on Energy Efficiency and Energy Related Materials (ENEFM2013) by Alexander Barvinok
Cover of the book Craft Beverages and Tourism, Volume 2 by Alexander Barvinok
Cover of the book Formal Methods: Foundations and Applications by Alexander Barvinok
Cover of the book Mastering Advanced Rhinoplasty by Alexander Barvinok
Cover of the book Gravitational Wave Astrophysics by Alexander Barvinok
Cover of the book Head Injury Simulation in Road Traffic Accidents by Alexander Barvinok
Cover of the book Brainlesion: Glioma, Multiple Sclerosis, Stroke and Traumatic Brain Injuries by Alexander Barvinok
Cover of the book The Engineering Capstone Course by Alexander Barvinok
Cover of the book Reviews of Environmental Contamination and Toxicology Volume 244 by Alexander Barvinok
Cover of the book Learning in Public Policy by Alexander Barvinok
Cover of the book From Real to Complex Analysis by Alexander Barvinok
Cover of the book Residue Number Systems by Alexander Barvinok
Cover of the book First-Trimester Ultrasound by Alexander Barvinok
Cover of the book Nonsurgical Lip and Eye Rejuvenation Techniques by Alexander Barvinok
Cover of the book Guide to Distributed Simulation with HLA 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