pith. sign in

arxiv: cond-mat/0410241 · v1 · submitted 2004-10-11 · ❄️ cond-mat.stat-mech

Self-avoiding walks and trails on the 3.12 lattice

classification ❄️ cond-mat.stat-mech
keywords latticewalksconstantgrowthfindgeneratinggraphsself-avoiding
0
0 comments X
read the original abstract

We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ 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 $3.12^2$ 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 $3.12^2$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.