Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30) - Hardcover

Barvinok, Alexander

 
Image Not Available

Synopsis

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...

About the Author

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)

From the Back Cover

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...

"About this title" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date2017
  • ISBN 10 3319518283
  • ISBN 13 9783319518282
  • BindingHardcover
  • LanguageEnglish
  • Edition number1
  • Number of pages309

Other Popular Editions of the Same Title

Image Not Available

Featured Edition

ISBN 10:  3319847511 ISBN 13:  9783319847511
Publisher: Springer, 2018
Softcover