Self-avoiding walks and polygons on quasiperiodic tilings
arXiv:cond-mat/0302414 · doi:10.1088/0305-4470/36/24/305
Abstract
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices, these numbers depend on the chosen start vertex. We compare different ways of counting and demonstrate that suitable averaging improves converge to the asymptotic regime. This leads to improved estimates for critical points and exponents, which support the conjecture that self-avoiding walks on quasiperiodic tilings belong to the same universality class as self-avoiding walks on the square lattice. For polygons, the obtained e numeration data does not allow to draw decisive conclusions about the exponent.
arXiv comment17 pages, 12 figures. v2: minor changes, version as published
References in corpus (5)
- Algebraic Techniques for Enumerating Self-Avoiding Walks on the Square Lattice
- Scaling function and universal amplitude combinations for self-avoiding polygons
- Size and area of square lattice polygons
- High-temperature expansion for Ising models on quasiperiodic tilings
- Finite-lattice expansion for Ising models on quasiperiodic tilings