Combinatorics and Complexity of Partition Functions Image close
Combinatorics and Complexity of Partition Functions by Alexander Barvinok
Combinatorics and Complexity of Partition Functions by Alexander Barvinok
Show Hide Adult Content
Combinatorics and Complexity of Partition Functions close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Discrete mathematics

Combinatorics and Complexity of Partition Functions

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$373.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $93.25 with Afterpay Learn more

6 weekly interest-free payments of $62.17 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 11-21 June using International Courier

Explore more Algorithms and Combinatorics

See all products in this series

New Trends in Discrete and Computational Geometry
$154.00
New Trends in Discrete and Computational Geometry
Paperback / softback
Available - Usually ships in 3-4 weeks
Mathematics of Ramsey Theory
$295.00
Mathematics of Ramsey Theory
Paperback / softback
Available - Usually ships in 3-4 weeks
Systems Analysis by Graphs and Matroids by Kazuo Murota
$296.00
Systems Analysis by Graphs and Matroids
by Kazuo Murota ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Combinatorics and Complexity of Partition Functions on Hardback by Alexander Barvinok
$375.00
Combinatorics and Complexity of Partition Functions
by Alexander Barvinok ~ Hardback
Available - Usually ships in 3-4 weeks
Combinatorial Optimization by Bernhard Korte
$192.00
Combinatorial Optimization
by Bernhard Korte ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Optimal Interconnection Trees in the Plane on Hardback by Marcus Brazil
$158.00
Optimal Interconnection Trees in the Plane
by Marcus Brazil ~ Hardback
Available - Usually ships in 3-4 weeks
Discrete and Computational Geometry on Hardback
$471.00
Discrete and Computational Geometry
Hardback
Available - Usually ships in 3-4 weeks
Matrices and Matroids for Systems Analysis by Kazuo Murota
$446.00
Matrices and Matroids for Systems Analysis
by Kazuo Murota ~ Paperback / softback
Available - Usually ships in 3-4 weeks
The Simplex Method by Karl Heinz Borgwardt
$152.00
The Simplex Method
by Karl Heinz Borgwardt ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Graph Colouring and the Probabilistic Method on Hardback by Michael Molloy
$445.00
Graph Colouring and the Probabilistic Method
by Michael Molloy ~ Hardback
Available - Usually ships in 3-4 weeks
Irregularities of Partitions
$151.00
Irregularities of Partitions
Paperback / softback
Available - Usually ships in 3-4 weeks
Geometric Discrepancy
$460.00
Geometric Discrepancy
Paperback / softback
Available - Usually ships in 3-4 weeks
Greedoids by Bernhard Korte
$151.00
Greedoids
by Bernhard Korte ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Linear Optimization and Extensions on Hardback by Manfred Padberg
$304.00
Linear Optimization and Extensions
by Manfred Padberg ~ Hardback
Available - Usually ships in 3-4 weeks
Sparsity on Hardback by Jaroslav Nesetril
$277.00
Sparsity
by Jaroslav Nesetril ~ Hardback
Available - Usually ships in 3-4 weeks
Geometric Algorithms and Combinatorial Optimization by Laszlo Lovasz
$427.00
Geometric Algorithms and Combinatorial Optimization
by Laszlo Lovasz ~ Paperback / softback
Available - Usually ships in 3-4 weeks

Description

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. 

Author Biography:

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)
Release date NZ
July 18th, 2018
Pages
303
Edition
Softcover reprint of the original 1st ed. 2016
Audience
  • Professional & Vocational
Illustrations
42 Illustrations, color; 9 Illustrations, black and white; VI, 303 p. 51 illus., 42 illus. in color.
ISBN-13
9783319847511
Product ID
28341063

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Discrete mathematics
Books >
Non-Fiction >
Maths & Science >
Mathematics >
Calculus & mathematical analysis >
Differential equations
Books >
Non-Fiction >
Maths & Science >
Mathematics >
Applied mathematics
Books >
Non-Fiction >
Reference >
Research & information: general >
Information theory >
Cybernetics & systems theory
Books >
Computers & Internet >
Computer programming / software development >
Algorithms & data structures
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation >
Maths for computer scientists