Exact enumeration of self-avoiding walks
classification
🧮 math-ph
cond-mat.softmath.MP
keywords
enumerationself-avoidingwalksexactadvanceallowedcomparedcubic
read the original abstract
A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of enumeration, making the process thousands or millions of times faster. This allowed us to enumerate self-avoiding walks on the simple cubic lattice up to a length of 36 steps.
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.