Selected problems in lattice statistical mechanics
Yao-ban Chan
Abstract
This thesis consists of an introduction and four chapters, with each chapter covering a different topic.In the introduction, we introduce the models that we study in the later chapters.In Chapter 2, we study corner transfer matrices as a method for generating series expansions in statistical mechanical models.This is based on the work of Baxter, whose CTM equations we re-derive in detail.We then propose two methods that utilise these CTM equations to derive series expansions.The first one is based on iterating through the equations sequentially.We ran this algorithm on the hard squares model and produced 48 series terms.The second method, based on the corner transfer matrix renormalization group method of Nishino and Okunishi, is much faster (though still exponential in time), but only currently works for numerical calculations.In Chapter 3, we apply the finite lattice method and our renormalization group corner transfer matrix method to the Ising model with second-nearest-neighbour interactions.In particular, we study the crossover exponent of the critical line near the pointThrough a scaling assumption, we predict this exponent to be 4 7 , which is supported by our numerical methods.We also estimate the location of the critical lines, and the critical exponent of the magnetization along the lower phase boundary.In Chapter 4, we study the problem of n-friendly directed lattice walks confined in a horizontal strip.We find the general transfer matrix for two walkers, and use this and a method of recurrences to calculate generating functions for certain specific cases via Padé approximants.Using generating function arguments, we then derive the generating function for the number of walks for two walkers in strips of width 3 and 4, three walkers in a strip of width 4, and p vicious walkers in strips of width 2p -1, 2p, and 2p + 1. Finally we generalise the model by introducing another parameter, called bandwidth.In Chapter 5, we study mean unknotting times, in a problem motivated by DNA entanglement.Firstly, we find the mean unknotting times for minimal embeddings of low-crossing knots.Then we look at generating random embeddings by using self-avoiding polygon trails (SAPTs).After proving Kesten's pattern theorem, we use it and the model of a walk on an n-cube to estimate that the mean unknotting time grows exponentially in the length of the SAPT.We try to find the growth constant by using the pivot algorithm to generate SAPTs, but the low-length behaviour of the mean unknotting time appears to follow a power law, leading us to believe that much longer trails are needed.• To my supervisors:-Tony, for looking after me from beginning to end (and after); -Ian, for looking after me at conferences among other things (and reading 230 pages while attending one); and-Andrew, for putting up with me knocking on his door every other day or so.• To my family:-My parents, for always supporting, feeding and housing me;-Yi-Shuen, for having someone to talk to and play games with;-Mandy, for providing entertainment; and last but not least, -Bilbo, for looking cute.• To inanimate objects:-Computer games, for keeping me sane;-Table tennis, for keeping me entertained, exercised and friend-ly at the same time; and-Piano, for giving me something else to do.