181 citations · 1.9k across the 66 of their papers we have counts for
6 papers · 1 filter
Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
Iwan Jensen
We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, , and lattices. The bound is found…
Self-avoiding walks and polygons on the triangular lattice
Iwan Jensen
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40…
Correction-to-scaling exponents for two-dimensional self-avoiding walks
Sergio Caracciolo, Anthony J. Guttmann, Iwan Jensen +3
We study the correction-to-scaling exponents for the two-dimensional self-avoiding walk, using a combination of series-extrapolation and Monte Carlo methods. We enumerate all self-…
Scaling prediction for self-avoiding polygons revisited
C. Richard, I. Jensen, A. J. Guttmann
We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we…
Low-density series expansions for directed percolation III. Some two-dimensional lattices
Iwan Jensen
We use very efficient algorithms to calculate low-density series for bond and site percolation on the directed triangular, honeycomb, kagomé, and lattices. Analysis of th…
Enumeration of self-avoiding walks on the square lattice
Iwan Jensen
We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number…