Mohlo by sa vám tiež páčiť

Viac informácií o knihe Combinatorics and Complexity of Partition Functions

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 386 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Discrete mathematics

• Celý názov: Combinatorics and Complexity of Partition Functions
• Autor: Alexander Barvinok
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 303
• EAN: 9783319518282
• ISBN: 3319518283
• ID: 15634734
• Nakladateľ: Springer International Publishing AG
• Hmotnosť: 628 g
• Rozmery: 165 × 245 × 23 mm
• Dátum vydania: 21. March 2017

Obľúbené z iného súdka

---

---

---