大葉大學圖書館 |

Combinatorics and complexity of partition functions[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	512.73
書名/作者:	Combinatorics and complexity of partition functions/ by Alexander Barvinok.
作者:	Barvinok, Alexander.
出版者:	Cham : : Springer International Publishing :, 2016.
面頁冊數:	vi, 303 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Combinatorial analysis.
標題:	Partitions (Mathematics)
標題:	Mathematics.
標題:	Mathematics of Algorithmic Complexity.
標題:	Combinatorics.
標題:	Discrete Mathematics in Computer Science.
標題:	Complex Systems.
標題:	Algorithms.
標題:	Approximations and Expansions.
ISBN:	9783319518299
ISBN:	9783319518282
內容註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-51829-9

Combinatorics and complexity of partition functions[electronic resource] /
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

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

445599
Combinatorial analysis.

LC Class. No.: QA165 / .B37 2016

Dewey Class. No.: 512.73

Combinatorics and complexity of partition functions[electronic resource] /
LDR:02274nam a2200325 a 4500 001 477369
003 DE-He213
005 20170314123921.0
006 m d
007 cr nn 008maaau
008 181208s2016 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 688884
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 445599
650 0 $a Partitions (Mathematics) $3 464942
650 1 4 $a Mathematics. $3 172349
650 2 4 $a Mathematics of Algorithmic Complexity. $3 611242
650 2 4 $a Combinatorics. $3 464913
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Complex Systems. $3 465366
650 2 4 $a Algorithms. $3 182797
650 2 4 $a Approximations and Expansions. $3 464139
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Algorithms and combinatorics ; $v v.21. $3 467594
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-51829-9
950 $a Mathematics and Statistics (Springer-11649)