Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Combinatorics and Complexity of Partition Functions

Alexander Barvinok

Language

English

Book Paperback

Libristo code: 20093785

Publishers Springer International Publishing AG, July 2018

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

Libristo code: 20093785

352 b

52 823 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Maluchy kolorują. Pojazdy. Wydawnictwo Skrzat Wydawnictwo Skrzat

Paperback

677 Ft

BTS THE MOST BEAUTIFUL MOMENT IN LIFE PT. 1/ INCL. PHOTOCARD/2 VERSION BIG HIT ENTERTAINMENT Audio

Audio CD

7 822 Ft

Andere Welten - Interviews zur Science Fiction - Band 2

Paperback

7 851 Ft

W głowie Sherlocka Holmesa Tom 1 Liéron Cyryl

Hardback

5 630 Ft

Moc manifestowania Jordanna Levin

Paperback

3 376 Ft

Les Deux Fermiers, Comedie En Un Acte Et En Prose Silvestre

Paperback

5 346 Ft

HISTORIA ECLESIASTICA DE EUSEBIO Escriba de Cristo

Adobe ePub DRM

1 638 Ft

Sherlock Holmes Chronicles 51, Audio-CD Sherlock Holmes Chronicles

Audio CD

5 644 Ft

Unsere liabsten Stückln Die Liabste Weis-Partie

Audio CD

6 908 Ft

Qui suis-je

Game

4 939 Ft

Emerald Samura

Paperback

7 103 Ft

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.