[PDF] Full Combinatorics And Complexity Of Partition Functions Download eBook

Combinatorics and Complexity of Partition Functions

Author: Alexander Barvinok

Publisher: Springer

Published: 2017-03-13

Total Pages: 304

ISBN-13: 3319518291

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.

Arithmetic of Partition Functions and Q-combinatorics

Author: Byung Chan Kim

Publisher:

Published: 2010

Total Pages:

ISBN-13:

DOWNLOAD EBOOK

Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory of modular forms, representation theory, symmetric functions and mathematical physics. Among these, we study the arithmetic of partition functions and q-combinatorics via bijective methods, q-series and modular forms. In particular, regarding arithmetic properties of partition functions, we examine partition congruences of the overpartition function and cubic partition function and inequalities involving t-core partitions. Concerning q-combinatorics, we establish various combinatorial proofs for q-series identities appearing in Ramanujan's lost notebook and give combinatorial interpretations for third and sixth order mock theta functions.

Combinatorial and Analytic Properties of Partition Functions in AdS/LCFT

Author: Yannick Mvondo-She

Publisher:

Published: 2019

Total Pages:

ISBN-13:

DOWNLOAD EBOOK

The primary goal of this thesis is the study of the 1-loop partition function of critical topologically massive gravity, a theory conjectured to be dual to a logarithmic conformal field theory through the AdS3/LCFT2 correspondence. In particular, a better understanding of the combinatorics of the multi-log sector has been desired, in order to give the partition function a more concrete interpretation from an LCFT perspective. In this work we show that the partition function can be usefully rewritten as a Bell polynomial expansion. We also show that there is a relationship between this Bell polynomial expansion and the plethystic exponential. Finally, we discuss the appearance of a ladder action between the different multi-particle sectors in the partition function, which induces a sl(2) structure on the n-particle components of the partition function.

A Course in Convexity

Author: Alexander Barvinok

Publisher: American Mathematical Soc.

Published: 2002-11-19

Total Pages: 378

ISBN-13: 0821829688

DOWNLOAD EBOOK

Convexity is a simple idea that manifests itself in a surprising variety of places. This fertile field has an immensely rich structure and numerous applications. Barvinok demonstrates that simplicity, intuitive appeal, and the universality of applications make teaching (and learning) convexity a gratifying experience. The book will benefit both teacher and student: It is easy to understand, entertaining to the reader, and includes many exercises that vary in degree of difficulty. Overall, the author demonstrates the power of a few simple unifying principles in a variety of pure and applied problems. The prerequisites are minimal amounts of linear algebra, analysis, and elementary topology, plus basic computational skills. Portions of the book could be used by advanced undergraduates. As a whole, it is designed for graduate students interested in mathematical methods, computer science, electrical engineering, and operations research. The book will also be of interest to research mathematicians, who will find some results that are recent, some that are new, and many known results that are discussed from a new perspective.

The Complexity of Partition Functions

Author: Marc Thurley

Publisher:

Published: 2009

Total Pages: 7

ISBN-13:

DOWNLOAD EBOOK

Combinatorics, Complexity, and Chance

Author: Geoffrey Grimmett

Publisher:

Published: 2007

Total Pages: 330

ISBN-13:

DOWNLOAD EBOOK

Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, and percolation, and has taught, influenced and inspired generations of students and researchers in mathematics. This volume summarizes and reviews the consistent themes from his work through a series of articles written by renowned experts. These articles contain original research work, set in a broader context by the inclusion of review material. As a reference text in its own right, this book will be valuable to academic researchers, research students, and others seeking an introduction to the relevant contemporary aspects of these fields.

Analytic Combinatorics

Author: Philippe Flajolet

Publisher: Cambridge University Press

Published: 2009-01-15

Total Pages: 825

ISBN-13: 1139477161

DOWNLOAD EBOOK

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

Model Theoretic Methods in Finite Combinatorics

Author: Martin Grohe

Publisher: American Mathematical Soc.

Published: 2011-11-28

Total Pages: 529

ISBN-13: 0821849433

DOWNLOAD EBOOK

This volume contains the proceedings of the AMS-ASL Special Session on Model Theoretic Methods in Finite Combinatorics, held January 5-8, 2009, in Washington, DC. Over the last 20 years, various new connections between model theory and finite combinatorics emerged. The best known of these are in the area of 0-1 laws, but in recent years other very promising interactions between model theory and combinatorics have been developed in areas such as extremal combinatorics and graph limits, graph polynomials, homomorphism functions and related counting functions, and discrete algorithms, touching the boundaries of computer science and statistical physics. This volume highlights some of the main results, techniques, and research directions of the area. Topics covered in this volume include recent developments on 0-1 laws and their variations, counting functions defined by homomorphisms and graph polynomials and their relation to logic, recurrences and spectra, the logical complexity of graphs, algorithmic meta theorems based on logic, universal and homogeneous structures, and logical aspects of Ramsey theory.