Combinatorics and Complexity of Partition Functions: 30 - Rilegato

Libro 7 di 8: Algorithms and Combinatorics

Barvinok, Alexander

 
9783319518282: Combinatorics and Complexity of Partition Functions: 30

Sinossi

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. 

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

Alexander Barvinok is a professor of mathematics at the University of Michigan in Ann Arbor, interested in computational complexity and algorithms in algebra, geometry and combinatorics. The reader might be familiar with his books “A Course in Convexity” (AMS, 2002) and “Integer Points in Polyhedra” (EMS, 2008)

Dalla quarta di copertina

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. 

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9783319847511: Combinatorics and Complexity of Partition Functions: 30

Edizione in evidenza

ISBN 10:  3319847511 ISBN 13:  9783319847511
Casa editrice: Springer, 2018
Brossura