Combinatorics and Complexity of Partition Functions: 30 (Algorithms and Combinatorics) - Tapa blanda

Libro 7 de 8: Algorithms and Combinatorics

Barvinok, Alexander

 
9783319847511: Combinatorics and Complexity of Partition Functions: 30 (Algorithms and Combinatorics)
Tapa blanda
ISBN 10: 3319847511 ISBN 13: 9783319847511
Editorial: Springer, 2018

Sinopsis

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. 

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

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)

De la contraportada

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. 

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2018
Idioma
Inglés
ISBN 10 
3319847511
ISBN 13 
9783319847511
Encuadernación
Tapa blanda
Número de páginas
312
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9783319518282: Combinatorics and Complexity of Partition Functions: 30 (Algorithms and Combinatorics)

Edición Destacada

ISBN 10:  3319518283 ISBN 13:  9783319518282
Editorial: Springer, 2017
Tapa dura