Self-avoiding walks and polygons on quasiperiodic tilings

From MaRDI portal
Publication:4450154



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.


The authors analyze three different methods of counting problem of \(n\)-step walks on a quasiperiodic tiling, that is a) Fixed origin walks. The authors count the number of \(n\)-step self-avoiding walks emanating from a given vertex. This number depends on the chosen vertex. b) Mean number of walks. The authors count all translationally inequivalent \(n\)-step self-avoiding walks which may occur anywhere in the infinite tiling, weighted by their occurrence probability. c) Total number of walks. Here the authors count the number of translationally inequivalent \(n\)-step self-avoiding walks which may occur anywhere in the tiling. This number is bigger than the number of fixed origin values, and by definition, takes into account vertices over the whole tiling.











This page was built for publication: Self-avoiding walks and polygons on quasiperiodic tilings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450154)