This monograph examines the self-avoiding walk, a classical model in statistical mechanics, probability theory and mathematical physics, paying close attention to recent developments in the field, such as models in the hexagonal lattice and the Monte Carlo methods.

The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?rst sight, it seems surprising that it hasn’t been solved. It is however perhaps the simplest member of a large class of such problems that have resisted all attempts at their exact solution. These are all problems that are easy to state and look as if they should be solvable. They include percolation, in its various forms, the Ising model of ferromagnetism, polyomino enumeration, Potts models and many others. These models are of intrinsic interest to mathematicians and mathematical physicists, but can also be applied to many other areas, including economics, the social sciences, the biological sciences and even to traf?c models. It is the widespread applicab- ity of these models to interesting phenomena that makes them so deserving of our attention. Here however we restrict our attention to the mathematical aspects. Here we are concerned with collecting together most of what is known about polygons, and the closely related problems of polyominoes. We describe what is known, taking care to distinguish between what has been proved, and what is c- tainlytrue,but has notbeenproved. Theearlierchaptersfocusonwhatis knownand on why the problems have not been solved, culminating in a proof of unsolvability, in a certain sense. The next chapters describe a range of numerical and theoretical methods and tools for extracting as much information about the problem as possible, in some cases permittingexactconjecturesto be made.

This is a book written primarily for graduate students and early researchers in the fields of Analysis and Partial Differential Equations (PDEs). Coverage of the material is essentially self-contained, extensive and novel with great attention to details and rigour. The strength of the book primarily lies in its clear and detailed explanations, scope and coverage, highlighting and presenting deep and profound inter-connections between different related and seemingly unrelated disciplines within classical and modern mathematics and above all the extensive collection of examples, worked-out and hinted exercises. There are well over 700 exercises of varying level leading the reader from the basics to the most advanced levels and frontiers of research. The book can be used either for independent study or for a year-long graduate level course. In fact it has its origin in a year-long graduate course taught by the author in Oxford in 2004-5 and various parts of it in other institutions later on. A good number of distinguished researchers and faculty in mathematics worldwide have started their research career from the course that formed the basis for this book.

The lace expansion is a powerful and flexible method for understanding the critical scaling of several models of interest in probability, statistical mechanics, and combinatorics, above their upper critical dimensions. These models include the self-avoiding walk, lattice trees and lattice animals, percolation, oriented percolation, and the contact process. This volume provides a unified and extensive overview of the lace expansion and its applications to these models.

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.