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 Decision Making and Performance Evaluation Using Data Envelopment Analysis by Alexander Barvinok
Cover of the book Gravitational Atlas of Antarctica by Alexander Barvinok
Cover of the book The Complexity Turn by Alexander Barvinok
Cover of the book Oxygen Transport to Tissue XXXVIII by Alexander Barvinok
Cover of the book Algebra for Applications by Alexander Barvinok
Cover of the book Sinus Headache, Migraine, and the Otolaryngologist by Alexander Barvinok
Cover of the book Building Predicates by Alexander Barvinok
Cover of the book Fiber Optic Sensors by Alexander Barvinok
Cover of the book Energy Efficient Smart Phones for 5G Networks by Alexander Barvinok
Cover of the book Multiscale Models in Mechano and Tumor Biology by Alexander Barvinok
Cover of the book Childhood and Schooling in (Post)Socialist Societies by Alexander Barvinok
Cover of the book Modelling Aging and Migration Effects on Spatial Labor Markets by Alexander Barvinok
Cover of the book De Sitter Projective Relativity by Alexander Barvinok
Cover of the book Women in Medicine in Nineteenth-Century American Literature by Alexander Barvinok
Cover of the book Application of Soil Physics in Environmental Analyses 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