A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice

We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A detailed comparison with the previous best algorithm shows significant improvement in the running time of the algorithm. The new algorithm is used to extend the enumeration of polygons to length 130 from the previous record of 110.Comment: 17 pages, 8 figures, IoP style file

Complex-Temperature Singularities in the d=2d=2 Ising Model. III. Honeycomb Lattice

We study complex-temperature properties of the uniform and staggered susceptibilities $\chi$ and $\chi^{(a)}$ of the Ising model on the honeycomb lattice. From an analysis of low-temperature series expansions, we find evidence that $\chi$ and $\chi^{(a)}$ both have divergent singularities at the point $z=-1 \equiv z_{\ell}$ (where $z=e^{-2K}$), with exponents $\gamma_{\ell}'= \gamma_{\ell,a}'=5/2$. The critical amplitudes at this singularity are calculated. Using exact results, we extract the behaviour of the magnetisation $M$ and specific heat $C$ at complex-temperature singularities. We find that, in addition to its zero at the physical critical point, $M$ diverges at $z=-1$ with exponent $\beta_{\ell}=-1/4$, vanishes continuously at $z=\pm i$ with exponent $\beta_s=3/8$, and vanishes discontinuously elsewhere along the boundary of the complex-temperature ferromagnetic phase. $C$ diverges at $z=-1$ with exponent $\alpha_{\ell}'=2$ and at $v=\pm i/\sqrt{3}$ (where $v = \tanh K$) with exponent $\alpha_e=1$, and diverges logarithmically at $z=\pm i$. We find that the exponent relation $\alpha'+2\beta+\gamma'=2$ is violated at $z=-1$; the right-hand side is 4 rather than 2. The connections of these results with complex-temperature properties of the Ising model on the triangular lattice are discussed.Comment: 22 pages, latex, figures appended after the end of the text as a compressed, uuencoded postscript fil

Series studies of the Potts model. I: The simple cubic Ising model

The finite lattice method of series expansion is generalised to the $q$-state Potts model on the simple cubic lattice. It is found that the computational effort grows exponentially with the square of the number of series terms obtained, unlike two-dimensional lattices where the computational requirements grow exponentially with the number of terms. For the Ising ($q=2$) case we have extended low-temperature series for the partition functions, magnetisation and zero-field susceptibility to $u^{26}$ from $u^{20}$. The high-temperature series for the zero-field partition function is extended from $v^{18}$ to $v^{22}$. Subsequent analysis gives critical exponents in agreement with those from field theory.Comment: submitted to J. Phys. A: Math. Gen. Uses preprint.sty: included. 24 page

New Lower Bounds on the Self-Avoiding-Walk Connective Constant

We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice $Z^d$. The method is based on loop erasure and restoration, and does not require exact enumeration data. Our bounds are best for high $d$, and in fact agree with the first four terms of the $1/d$ expansion for the connective constant. The bounds are the best to date for dimensions $d \geq 3$, but do not produce good results in two dimensions. For $d=3,4,5,6$, respectively, our lower bound is within 2.4\%, 0.43\%, 0.12\%, 0.044\% of the value estimated by series extrapolation.Comment: 35 pages, 388480 bytes Postscript, NYU-TH-93/02/0

Partially directed paths in a wedge

The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating function, and solving for it. In this paper we consider a model of partially directed walks from the origin in the square lattice confined to both a symmetric wedge defined by $Y = \pm pX$, and an asymmetric wedge defined by the lines $Y= pX$ and Y=0, where $p > 0$ is an integer. We prove that the growth constant for all these models is equal to $1+\sqrt{2}$, independent of the angle of the wedge. We derive functional recursions for both models, and obtain explicit expressions for the generating functions when $p=1$. From these we find asymptotic formulas for the number of partially directed paths of length $n$ in a wedge when $p=1$. The functional recurrences are solved by a variation of the kernel method, which we call the ``iterated kernel method''. This method appears to be similar to the obstinate kernel method used by Bousquet-Melou. This method requires us to consider iterated compositions of the roots of the kernel. These compositions turn out to be surprisingly tractable, and we are able to find simple explicit expressions for them. However, in spite of this, the generating functions turn out to be similar in form to Jacobi $\theta$-functions, and have natural boundaries on the unit circle.Comment: 26 pages, 5 figures. Submitted to JCT

Effects of Eye-phase in DNA unzipping

The onset of an "eye-phase" and its role during the DNA unzipping is studied when a force is applied to the interior of the chain. The directionality of the hydrogen bond introduced here shows oscillations in force-extension curve similar to a "saw-tooth" kind of oscillations seen in the protein unfolding experiments. The effects of intermediates (hairpins) and stacking energies on the melting profile have also been discussed.Comment: RevTeX v4, 9 pages with 7 eps figure

Force induced triple point for interacting polymers

We show the existence of a force induced triple point in an interacting polymer problem that allows two zero-force thermal phase transitions. The phase diagrams for three different models of mutually attracting but self avoiding polymers are presented. One of these models has an intermediate phase and it shows a triple point but not the others. A general phase diagram with multicritical points in an extended parameter space is also discussed.Comment: 4 pages, 8 figures, revtex

Series expansions of the percolation probability on the directed triangular lattice

We have derived long series expansions of the percolation probability for site, bond and site-bond percolation on the directed triangular lattice. For the bond problem we have extended the series from order 12 to 51 and for the site problem from order 12 to 35. For the site-bond problem, which has not been studied before, we have derived the series to order 32. Our estimates of the critical exponent $\beta$ are in full agreement with results for similar problems on the square lattice, confirming expectations of universality. For the critical probability and exponent we find in the site case: $q_c = 0.4043528 \pm 0.0000010$ and $\beta = 0.27645 \pm 0.00010$; in the bond case: $q_c = 0.52198\pm 0.00001$ and $\beta = 0.2769\pm 0.0010$; and in the site-bond case: $q_c = 0.264173 \pm 0.000003$ and $\beta = 0.2766 \pm 0.0003$. In addition we have obtained accurate estimates for the critical amplitudes. In all cases we find that the leading correction to scaling term is analytic, i.e., the confluent exponent $\Delta = 1$.Comment: 26 pages, LaTeX. To appear in J. Phys.

Test of Guttmann and Enting's conjecture in the eight-vertex model

We investigate the analyticity property of the partially resummed series expansion(PRSE) of the partition function for the eight-vertex model. Developing a graphical technique, we have obtained a first few terms of the PRSE and found that these terms have a pole only at one point in the complex plane of the coupling constant. This result supports the conjecture proposed by Guttmann and Enting concerning the ``solvability'' in statistical mechanical lattice models.Comment: 15 pages, 3 figures, RevTe

Statistics of lattice animals (polyominoes) and polygons

We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the growth constant of lattice animals and confirms to a very high degree of certainty that the generating function has a logarithmic divergence. We prove the bound $\tau > 3.90318.$ We also calculate the radius of gyration of both lattice animals and polygons enumerated by area. The analysis of the radius of gyration series yields the estimate $\nu = 0.64115(5)$, for both animals and polygons enumerated by area. The mean perimeter of polygons of area $n$ is also calculated. A number of new amplitude estimates are given.Comment: 10 pages, 2 eps figure