Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Combinatorics and Complexity of Partition Functions [electronic resource] / by Alexander Barvinok.

By: Contributor(s): Material type: TextTextSeries: Algorithms and Combinatorics ; 30Publisher: Cham : Springer International Publishing : Imprint: Springer, 2016Description: VI, 303 p. 51 illus., 42 illus. in color. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783319518299
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 511.352 23
LOC classification:
  • QA9.58
Online resources:
Contents:
Chapter I. Introduction -- Chapter II. Preliminaries -- Chapter III. Permanents -- Chapter IV. Hafnians and Multidimensional Permanents -- Chapter V. The Matching Polynomial -- Chapter VI. The Independence Polynomial -- Chapter VII. The Graph Homomorphism Partition Function -- Chapter VIII. Partition Functions of Integer Flows -- References -- Index.
In: Springer eBooksSummary: 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. .
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Chapter I. Introduction -- Chapter II. Preliminaries -- Chapter III. Permanents -- Chapter IV. Hafnians and Multidimensional Permanents -- Chapter V. The Matching Polynomial -- Chapter VI. The Independence Polynomial -- Chapter VII. The Graph Homomorphism Partition Function -- Chapter VIII. Partition Functions of Integer Flows -- References -- Index.

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

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in