Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Selected problems in lattice statistical mechanics

Yao-ban Chan

Published Dec 1, 2005• 3 citations
OpenAlex

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.

Related papers

Corner transfer matrix derived variational methods in lattice statistical mechanics and quantum many-body systems

Chunhoa Chhenh

The concept of the corner transfer matrix (CTM) was first discovered by Baxter in 1968, when he derived a set of variational matrix equations, which for finite matrix sizes, could be numerically solved to obtain a sequence of approximations for the statistical mechanical properties of a system of monomers and dimers on a rectangular lattice [1]. It was not until 1978, however, in a seminal paper entitled "Variational Approximations for Square Lattice Models in Statistical Mechanics" [4], that Baxter outlined his CTM variational method, which brought to light the potential power of the former objects to obtain numerics and series expansions for unsolved models and to calculate the order parameter of solved ones. Subsequent numerical work led to the realisation that the method, though general, was not very efficient; and increasing efficiency required making model specific modifications, which restricted the transferability of the resulting algorithm to other models. The CTM variational method was thus not widely adopted, despite holding much promise. More recently, however, Nishino and Okunishi discovered that White's density matrix renormalisation group (DMRG) algorithm [55, 56] could be efficiently extended to study two-dimensional classical lattice models, if the density matrix was approximated by Baxters CTMs. Numerical tests of their algorithm, the corner transfer matrix renormalisation group (CTMRG) method, were met with much success. Notable among these is its implementation within the infinite projected entangled-pair states (iPEPS) algorithm of Orus and Vidal to simulate the ground state of infinite two-dimensional quantum systems. In this thesis we review CTM derived variational methods: Baxter's original CTM iterative method, and developments of the CTM concept within the DMRG algorithm by Nishino and Okunishi, which led to the CTMRG method to calculate critical phenomena of classical and quantum systems. This will begin with elucidating the theoretical formalisms of both methods in two dimensions and their generalisations to three dimensions; followed by review of important application, namely, within the iPEPS algorithm of Orus and Vidal to numerically study infinite planar quantum systems.

•Jan 1, 2011•0 citations

Computational approach to scaling and criticality in planar Ising models

Mikhail Dudalev

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.

•Jan 1, 2012•0 citations

Series expansions from the corner transfer matrix renormalization group method: II. Asymmetry and high-density hard squares

Yao-ban Chan

The corner transfer matrix renormalization group method is a method, claimed to be subexponential, for numerically calculating physical quantities of statistical mechanical models. In a previous paper, we extended this method to generate series expansions. Here, we show how to extend both the original and series methods to deal with asymmetry in any model. We discuss the cases of rotational, translational and reflection asymmetry, and give some improvements to the method. This is demonstrated by an application of the method to generate series for the hard square model in the high-density regime, producing 51 terms of the partition function and 48 terms of the order parameter. These series are analysed, producing estimates of the critical point and exponents, and showing the likely presence of a confluent singularity with exponent 17/8 in the order parameter.

Journal of Physics A Mathematical and Theoretical•Mar 8, 2013•6 citations

Series expansions from the corner transfer matrix renormalization group method: the hard-squares model

Yao-ban Chan

The corner transfer matrix renormalization group method is an efficient method for evaluating physical quantities in statistical mechanical models. It originates from Baxter’s corner transfer matrix equations and method, and was developed by Nishino and Okunishi in 1996. In this paper, we review and adapt this method, previously used for numerical calculations, to derive series expansions. We use this to calculate 92 terms of the partition function of the hard-squares model. We use the resulting series to provide evidence supporting the claim that the method is subexponential in the number of generated terms, and briefly analyse the singularities of the function.

arXiv:1107.1677•Journal of Physics A Mathematical and Theoretical•Feb 9, 2012•21 citations

Advanced Statistical Mechanics

Barry M. McCoy

Abstract This book begins where elementary books and courses leave off and covers the advances made in statistical mechanics in the past fifty years. The book is divided into three parts. The first part is on general theory which includes a summary of the basic principles of statistical mechanics; a presentation of the physical phenomena covered and the models used to discuss them; theorems on the existence and uniqueness of partition functions; theorems on order; and critical phenomena and scaling theory. The second part is on series and numerical methods which includes derivations of the Mayer and Ree–Hoover expansions of the low density virial equation of state; Groeneveld's theorems; the application to hard spheres and discs; a summary of numerical studies of systems at high density; and the use of high temperature series expansions to estimate critical exponents for magnets. The third part covers exactly solvable models which includes a detailed presentation of the Pfaffian methods of computing the Ising partition function, magnetization, correlation functions, and susceptibility; the star-triangle (Yang–Baxter equation); functional equations and the free energy for the eight-vertex model; and the hard hexagon and chiral Potts models. All needed mathematics is developed in detail and many open questions are discussed. The goal is to guide the reader to the current forefront of research.

•Dec 1, 2009•109 citations

On Ising models

Hoede, C., Zandvliet, Henricus J.W.

For various Ising models two approaches are discussed, one is that of simulating lattices, also called gauging on exact equations, the other is that of calculating analytical expressions for the boundary free energy of Ising lattices. The first approach allows to conjecture a solution for some Ising models, that have sofar not been solved, once some exact partial result for the problem is known. The second approach aims at furnishing such a partial result in the form of a condition for the critical temperature. An example of such a result was recently given for the 2D Ising square lattice with nearest and next-nearest-neighbor interactions. The critical line that separates the ordered (ferromagnetic) phase from the disordered (paramagnetic) phase showed good agreement in the moderate and strong nearest neighbor coupling limit with several results obtained by Monte Carlo, transfer matrix and series expansion results. We extend the discussion of the critical line, finding an excellent fit, now also in other points, like the Padé point, as well as cusp behavior at the Onsager point where the lattice decouples into two 2D square lattices with only nearest-neighbor interaction. Combination of this result with a geometrical argument in the simulation approach leads to a critical exponent $2-\sqrt{2} \approx 0.5858,$ comparable to the exponent $4/7 \approx 0.5714$ found from renormalization arguments.

•Jun 1, 2006•0 citations
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.
The concept of the corner transfer matrix (CTM) was first discovered by Baxter in 1968, when he derived a set of variational matrix equations, which for finite matrix sizes, could be numerically solved to obtain a sequence of approximations for the statistical mechanical properties of a system of monomers and dimers on a rectangular lattice [1]. It was not until 1978, however, in a seminal paper entitled "Variational Approximations for Square Lattice Models in Statistical Mechanics" [4], that Baxter outlined his CTM variational method, which brought to light the potential power of the former objects to obtain numerics and series expansions for unsolved models and to calculate the order parameter of solved ones. Subsequent numerical work led to the realisation that the method, though general, was not very efficient; and increasing efficiency required making model specific modifications, which restricted the transferability of the resulting algorithm to other models. The CTM variational method was thus not widely adopted, despite holding much promise. More recently, however, Nishino and Okunishi discovered that White's density matrix renormalisation group (DMRG) algorithm [55, 56] could be efficiently extended to study two-dimensional classical lattice models, if the density matrix was approximated by Baxters CTMs. Numerical tests of their algorithm, the corner transfer matrix renormalisation group (CTMRG) method, were met with much success. Notable among these is its implementation within the infinite projected entangled-pair states (iPEPS) algorithm of Orus and Vidal to simulate the ground state of infinite two-dimensional quantum systems. In this thesis we review CTM derived variational methods: Baxter's original CTM iterative method, and developments of the CTM concept within the DMRG algorithm by Nishino and Okunishi, which led to the CTMRG method to calculate critical phenomena of classical and quantum systems. This will begin with elucidating the theoretical formalisms of both methods in two dimensions and their generalisations to three dimensions; followed by review of important application, namely, within the iPEPS algorithm of Orus and Vidal to numerically study infinite planar quantum systems.
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 corner transfer matrix renormalization group method is a method, claimed to be subexponential, for numerically calculating physical quantities of statistical mechanical models. In a previous paper, we extended this method to generate series expansions. Here, we show how to extend both the original and series methods to deal with asymmetry in any model. We discuss the cases of rotational, translational and reflection asymmetry, and give some improvements to the method. This is demonstrated by an application of the method to generate series for the hard square model in the high-density regime, producing 51 terms of the partition function and 48 terms of the order parameter. These series are analysed, producing estimates of the critical point and exponents, and showing the likely presence of a confluent singularity with exponent 17/8 in the order parameter.
The corner transfer matrix renormalization group method is an efficient method for evaluating physical quantities in statistical mechanical models. It originates from Baxter’s corner transfer matrix equations and method, and was developed by Nishino and Okunishi in 1996. In this paper, we review and adapt this method, previously used for numerical calculations, to derive series expansions. We use this to calculate 92 terms of the partition function of the hard-squares model. We use the resulting series to provide evidence supporting the claim that the method is subexponential in the number of generated terms, and briefly analyse the singularities of the function.
Abstract This book begins where elementary books and courses leave off and covers the advances made in statistical mechanics in the past fifty years. The book is divided into three parts. The first part is on general theory which includes a summary of the basic principles of statistical mechanics; a presentation of the physical phenomena covered and the models used to discuss them; theorems on the existence and uniqueness of partition functions; theorems on order; and critical phenomena and scaling theory. The second part is on series and numerical methods which includes derivations of the Mayer and Ree–Hoover expansions of the low density virial equation of state; Groeneveld's theorems; the application to hard spheres and discs; a summary of numerical studies of systems at high density; and the use of high temperature series expansions to estimate critical exponents for magnets. The third part covers exactly solvable models which includes a detailed presentation of the Pfaffian methods of computing the Ising partition function, magnetization, correlation functions, and susceptibility; the star-triangle (Yang–Baxter equation); functional equations and the free energy for the eight-vertex model; and the hard hexagon and chiral Potts models. All needed mathematics is developed in detail and many open questions are discussed. The goal is to guide the reader to the current forefront of research.
For various Ising models two approaches are discussed, one is that of simulating lattices, also called gauging on exact equations, the other is that of calculating analytical expressions for the boundary free energy of Ising lattices. The first approach allows to conjecture a solution for some Ising models, that have sofar not been solved, once some exact partial result for the problem is known. The second approach aims at furnishing such a partial result in the form of a condition for the critical temperature. An example of such a result was recently given for the 2D Ising square lattice with nearest and next-nearest-neighbor interactions. The critical line that separates the ordered (ferromagnetic) phase from the disordered (paramagnetic) phase showed good agreement in the moderate and strong nearest neighbor coupling limit with several results obtained by Monte Carlo, transfer matrix and series expansion results. We extend the discussion of the critical line, finding an excellent fit, now also in other points, like the Padé point, as well as cusp behavior at the Onsager point where the lattice decouples into two 2D square lattices with only nearest-neighbor interaction. Combination of this result with a geometrical argument in the simulation approach leads to a critical exponent 2−2≈0.5858,2-\sqrt{2} \approx 0.5858,2−2​≈0.5858, comparable to the exponent 4/7≈0.57144/7 \approx 0.57144/7≈0.5714 found from renormalization arguments.