Hamiltonian walks on Sierpinski and n-simplex fractals
Statistical Mechanics
2009-11-10 v3
Abstract
We study Hamiltonian walks (HWs) on Sierpinski and --simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant and find the asymptotic behaviour of the number of HWs. Depending on whether or not the polymer collapse transition is possible on a studied lattice, different scaling relations for the number of HWs are obtained. These relations are in general different from the well-known form characteristic of homogeneous lattices which has thus far been assumed to hold for fractal lattices too.
Keywords
Cite
@article{arxiv.cond-mat/0310777,
title = {Hamiltonian walks on Sierpinski and n-simplex fractals},
author = {Jelena Stajic and Suncica Elezovic-Hadzic},
journal= {arXiv preprint arXiv:cond-mat/0310777},
year = {2009}
}
Comments
22 pages, 6 figures; final version