Items related to Combinatorics and Complexity of Partition Functions...
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.
"synopsis" may belong to another edition of this title.
About the Author:
Review:
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)
“The book is aimed at graduate students and researchers in theoretical computer science, combinatorics and statistical physics. ... The author has the ability to make complicated proofs very accessible while not sacrificing any mathematical rigour, making it a pleasure to read. ... The book also moves from the particular to the general ... . An advantage of this is that it makes it easier to understand the key ideas.” (Guus Regts, Mathematical Reviews, August, 2018)
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2018
- ISBN 10 3319847511
- ISBN 13 9783319847511
- BindingPaperback
- Number of pages309
Buy New
Learn more about this copy
US$ 57.77
Shipping:
US$ 12.73
From United Kingdom to U.S.A.
Top Search Results from the AbeBooks Marketplace
Stock Image
Combinatorics and Complexity of Partition Functions
Published by
Springer
(2018)
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783319847511_lsuk
Buy New
US$ 57.77
Convert currency
Seller Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics) by Barvinok, Alexander [Paperback ]
Seller:
Rating
Book Description Soft Cover. Condition: new. Seller Inventory # 9783319847511
Buy New
US$ 70.60
Convert currency
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing Jul 2018
(2018)
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Taschenbuch
Quantity: 2
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 312 pp. Englisch. Seller Inventory # 9783319847511
Buy New
US$ 53.80
Convert currency
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing
(2018)
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Taschenbuch
Quantity: 1
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783319847511
Buy New
US$ 60.44
Convert currency
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing
(2018)
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Contains an exposition of recent results Demonstrates a unified approach to hard algorithmic problemsProvides an easy to read introduction to statistical physics phenomena Contains an ex. Seller Inventory # 448758671
Buy New
US$ 49.16
Convert currency
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller:
Rating
Book Description Condition: New. Buy with confidence! Book is in new, never-used condition 0.98. Seller Inventory # bk3319847511xvz189zvxnew
Buy New
US$ 119.57
Convert currency
Stock Image
Combinatorics and Complexity of Partition Functions
Seller:
Rating
Book Description PF. Condition: New. Seller Inventory # 6666-IUK-9783319847511
Buy New
US$ 100.70
Convert currency
Seller Image
Combinatorics and Complexity of Partition Functions
Seller:
Rating
Book Description Condition: New. Seller Inventory # 33411324-n
Buy New
US$ 148.56
Convert currency
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Published by
Springer
(2018)
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLIING23Mar3113020109781
Buy New
US$ 147.22
Convert currency
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller:
Rating
Book Description Paperback. Condition: New. New. book. Seller Inventory # D8F0-0-M-3319847511-6
Buy New
US$ 130.90
Convert currency