In this thesis, we study the critical behaviour of the two-dimensional Ising model on the regular lattices. Using the numerical solution of the model on the square, triangular and honeycomb lattices we compute the universal scaling function, which turns out to be identical on each of the lattices, in addition to being identical to the scaling function of the Ising Field Theory, computed previously by Fonseca and Zamolodchikov. To cope with the lattice contributions we carefully examined series expansions of the lattice free energy derivatives. We included the non-scaling regular part of the free energy as well as non-linear Aharony-Fisher scaling elds, which all have non-universal expansions. Using as many of the previously known exact results as possible, we were able to t the unknown coe cients of the scaling function expansion and obtain some non-universal coe cients. In contrast to the IFT approach of Fonseca and Zamolodchikov, all coe cients were obtained independently from separate datasets, without using dispersion relations. These results show that the Scaling and Universality hypotheses, with the help of the Aharony-Fisher corrections, hold on the lattice to very high precision and so there should be no doubt of their validity. For all numerical computations we used the Corner Transfer Matrix Renormalisation Group (CTMRG) algorithm, introduced by Nishino and Okunishi. The algorithm combines Baxter's variational approach (which gives Corner Transfer Matrix (CTM) equations), and White's Density Matrix Renormalisation Group (DMRG) method to solve the CTM equations e ciently. It was shown that given su cient distance from the critical point, the algorithmic precision is exceptionally good and is unlikely to be exceeded with any other general algorithm using the same amount of numerical computations. While performing tests we also con rmed several critical parameters of the three-state Ising and Blume-Capel models, although no extra precision was gained, compared to previous results from other methods. In addition to the results presented here, we produced an efficient and reusable implementation of the CTMRG algorithm, which after minor modifications could be used for a variety of lattice models, such as the Kashiwara-Miwa and the chiral Potts models.
In this thesis, we study the critical behaviour of the two-dimensional Ising model on the regular lattices. Using the numerical solution of the model on the square, triangular and honeycomb lattices we compute the universal scaling function, which turns out to be identical on each of the lattices, in addition to being identical to the scaling function of the Ising Field Theory, computed previously by Fonseca and Zamolodchikov. To cope with the lattice contributions we carefully examined series expansions of the lattice free energy derivatives. We included the non-scaling regular part of the free energy as well as non-linear Aharony-Fisher scaling elds, which all have non-universal expansions. Using as many of the previously known exact results as possible, we were able to t the unknown coe cients of the scaling function expansion and obtain some non-universal coe cients. In contrast to the IFT approach of Fonseca and Zamolodchikov, all coe cients were obtained independently from separate datasets, without using dispersion relations. These results show that the Scaling and Universality hypotheses, with the help of the Aharony-Fisher corrections, hold on the lattice to very high precision and so there should be no doubt of their validity. For all numerical computations we used the Corner Transfer Matrix Renormalisation Group (CTMRG) algorithm, introduced by Nishino and Okunishi. The algorithm combines Baxter's variational approach (which gives Corner Transfer Matrix (CTM) equations), and White's Density Matrix Renormalisation Group (DMRG) method to solve the CTM equations e ciently. It was shown that given su cient distance from the critical point, the algorithmic precision is exceptionally good and is unlikely to be exceeded with any other general algorithm using the same amount of numerical computations. While performing tests we also con rmed several critical parameters of the three-state Ising and Blume-Capel models, although no extra precision was gained, compared to previous results from other methods. In addition to the results presented here, we produced an efficient and reusable implementation of the CTMRG algorithm, which after minor modifications could be used for a variety of lattice models, such as the Kashiwara-Miwa and the chiral Potts models.
The scaling function of the two-dimensional Ising model on the square and triangular lattices is obtained numerically via Baxter's variational corner transfer-matrix approach. The use of Aharony-Fisher nonlinear scaling variables allowed us to perform calculations sufficiently away from the critical point and to confirm all predictions of the scaling and universality hypotheses. Our results are in excellent agreement with quantum field theory calculations of Fonseca and Zamolodchikov as well as with many previously known exact and numerical calculations, including susceptibility results by Barouch, McCoy, Tracy, and Wu.
The universal scaling function of the square lattice Ising model in a magnetic field is obtained numerically via Baxter's variational corner transfer matrix approach. The high precision numerical data are in perfect agreement with the remarkable field theory results obtained by Fonseca and Zamolodchikov, as well as with many previously known exact and numerical results for the 2D Ising model. This includes excellent agreement with analytic results for the magnetic susceptibility obtained by Orrick, Nickel, Guttmann and Perk. In general, the high precision of the numerical results underlines the potential and full power of the variational corner transfer matrix approach.
The density series of the non-interacting hard-square lattice gas model are reanalyzed by the ratio, Dlog Pad and differential approximant methods.The problem of poor consistency between series and other results is resolved.Transfer matrix calculations are performed, implementing both finite-size scaling and conformal invariance.Very accurate estimates of the critical exponents y, and yh are obtained in agreement with Ising universality.Furthermore, an improvement of the value of the critical density pc is found.In addition, the universal critical-point ratios of the square of the second and the fourth moment of the magnetization for ferromagnetic Ising models on the square and on the triangular lattice with periodic boundary conditions are reported.
Finite-size corrections to scaling of critical correlation lengths and free energies of Ising and three-state Potts ferromagnets are analysed by numerical methods, on strips of width N sites of square, triangular and honeycomb lattices. Strong evidence is given that the amplitudes of the `analytical' correction terms, N -2 , are identically zero for triangular and honeycomb Ising systems. For Potts spins, our results are broadly consistent with this lattice-dependent pattern of cancellations, though for correlation lengths non-vanishing (albeit rather small) amplitudes cannot be entirely ruled out.
We study the spin-1/2 Ising model and the Blume-Capel model at various values of the parameter D on the simple cubic lattice. To this end we perform Monte Carlo simulations using a hybrid of the local Metropolis, the single cluster and the wall cluster algorithm. Using finite size scaling we determine the value ${D}^{\ensuremath{\ast}}=0.656(20)$ of the parameter D, where leading corrections to scaling vanish. We find $\ensuremath{\omega}=0.832(6)$ for the exponent of leading corrections to scaling. In order to compute accurate estimates of critical exponents, we construct improved observables that have a small amplitude of the leading correction for any model. Analyzing data obtained for D=0.641 and 0.655 on lattices of a linear size up to L=360 we obtain $\ensuremath{\nu}=0.63002(10)$ and $\ensuremath{\eta}=0.03627(10)$. We compare our results with those obtained from previous Monte Carlo simulations and high-temperature series expansions of lattice models, by using field-theoretic methods and experiments.
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.