Combinatorics and Complexity of Partition Functions (Hardcover, 1st ed. 2016)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Algorithms and Combinatorics, 30
Release date:	March 2017
First published:	2016
Authors:	Alexander Barvinok
Dimensions:	235 x 155 x 23mm (L x W x T)
Format:	Hardcover
Pages:	303
Edition:	1st ed. 2016
ISBN-13:	978-3-319-51828-2
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Vector & tensor analysis Promotions
LSN:	3-319-51828-3
Barcode:	9783319518282

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!