Combinatorics and Complexity of Partition Functions

Autor: Alexander Barvinok

Jazyk:

Vazba: Brožovaná

Vydavatel: Springer International Publishing AG

Dostupnost: Skladem u dodavatele

Odesíláme za 10-18 dnů

1 270 Kč

Partition functions arise in combinatorics and related problems of statistical physics as they encod...

Informace o knize

Autor

Alexander Barvinok

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

2018

Stránek

303

EAN

9783319847511

Enbook ID

20093785

Vydavatel

Springer International Publishing AG

Hmotnost

476

Rozměry

155 x 17 x 17

Kompletní popis

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.

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Combinatorics and Complexity of Partition Functions

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také