Combinatorics and Complexity of Partition Functions (1st ed. 2016) (Algorithms and Combinatorics #30)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2016
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783319518299
- Related ISBNs:
- 9783319518282
- Publisher:
- Springer International Publishing
- Date of Addition:
- 09/25/19
- Copyrighted By:
- Springer International Publishing, Cham
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Science, Computers and Internet, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Alexander Barvinok
- in Nonfiction
- in Science
- in Computers and Internet
- in Mathematics and Statistics