Self-avoiding walks and trails on the 3.12 lattice
Statistical Mechanics
2009-11-10 v1
Abstract
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the lattice. A result of Watson then allows us to find the generating function and growth constant of neighbour-avoiding walks on the covering lattice of the lattice which is tetra-valent. A mapping into walks on the covering lattice allows us to obtain improved bounds on the growth constant for a range of lattices.
Keywords
Cite
@article{arxiv.cond-mat/0410241,
title = {Self-avoiding walks and trails on the 3.12 lattice},
author = {Anthony J. Guttmann and Robert Parviainen and Andrew Rechnitzer},
journal= {arXiv preprint arXiv:cond-mat/0410241},
year = {2009}
}
Comments
15 pages, 8 figures