Self-avoiding walks and polygons on quasiperiodic tilings
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)