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 Research and Development in the Academy, Creative Industries and Applications by Alexander Barvinok
Cover of the book Lignocellulosic Composite Materials by Alexander Barvinok
Cover of the book Lebanon’s Jewish Community by Alexander Barvinok
Cover of the book Modelling with the Master Equation by Alexander Barvinok
Cover of the book Dairy Chemistry and Biochemistry by Alexander Barvinok
Cover of the book Working with the American Community Survey in R by Alexander Barvinok
Cover of the book Resistance and Change in World Politics by Alexander Barvinok
Cover of the book Theory and Practice of Risk Assessment by Alexander Barvinok
Cover of the book Victorian Narratives of the Recent Past by Alexander Barvinok
Cover of the book Electronic Government by Alexander Barvinok
Cover of the book The Regulatory Regime of Food Safety in China by Alexander Barvinok
Cover of the book British Romantic Literature and the Emerging Modern Greek Nation by Alexander Barvinok
Cover of the book Research in Attacks, Intrusions, and Defenses by Alexander Barvinok
Cover of the book Control of Self-Organizing Nonlinear Systems by Alexander Barvinok
Cover of the book Immanent Reasoning or Equality in Action 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