國立高雄大學圖資館 |

Language: English

Back

Combinatorics and complexity of part...

Barvinok, Alexander.

Combinatorics and complexity of partition functions

Record Type:	Electronic resources : Monograph/item
Title/Author:	Combinatorics and complexity of partition functionsby Alexander Barvinok.
Author:	Barvinok, Alexander.
Published:	Cham :Springer International Publishing :2016.
Description:	vi, 303 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Combinatorial analysis.
Online resource:	http://dx.doi.org/10.1007/978-3-319-51829-9
ISBN:	9783319518299$q(electronic bk.)

Combinatorics and complexity of partition functions
Barvinok, Alexander.

Combinatorics and complexity of partition functions[electronic resource] /by Alexander Barvinok. - Cham :Springer International Publishing :2016. - vi, 303 p. :ill., digital ;24 cm. - Algorithms and combinatorics,v.300937-5511 ;. - Algorithms and combinatorics ;v.21..

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.

ISBN: 9783319518299$q(electronic bk.)

Standard No.: 10.1007/978-3-319-51829-9doiSubjects--Topical Terms:

182280
Combinatorial analysis.

LC Class. No.: QA165 / .B37 2016

Dewey Class. No.: 512.73

Combinatorics and complexity of partition functions
LDR:02274nmm a2200325 a 4500 001 502511
003 DE-He213
005 20170314123921.0
006 m d
007 cr nn 008maaau
008 170823s2016 gw s 0 eng d
020 $a 9783319518299$q(electronic bk.)
020 $a 9783319518282$q(paper)
024 7 $a 10.1007/978-3-319-51829-9 $2 doi
035 $a 978-3-319-51829-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA165 $b .B37 2016
072 7 $a PBWH $2 bicssc
072 7 $a MAT003000 $2 bisacsh
082 0 4 $a 512.73 $2 23
090 $a QA165 $b .B295 2016
100 1 $a Barvinok, Alexander. $3 766753
245 1 0 $a Combinatorics and complexity of partition functions $h [electronic resource] / $c by Alexander Barvinok.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a vi, 303 p. : $b ill., digital ; $c 24 cm.
490 1 $a Algorithms and combinatorics, $x 0937-5511 ; $v v.30
505 0 $a 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.
520 $a 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.
650 0 $a Combinatorial analysis. $3 182280
650 0 $a Partitions (Mathematics) $3 239773
650 1 4 $a Mathematics. $3 184409
650 2 4 $a Mathematics of Algorithmic Complexity. $3 675328
650 2 4 $a Combinatorics. $3 274788
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Complex Systems. $3 558544
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Approximations and Expansions. $3 281039
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Algorithms and combinatorics ; $v v.21. $3 560076
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-51829-9
950 $a Mathematics and Statistics (Springer-11649)