Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorBisseling, Prof. Rob
dc.contributor.advisorBarkema, Prof. Gerard
dc.contributor.authorSchram, R.D.
dc.date.accessioned2012-06-27T17:00:46Z
dc.date.available2012-06-27
dc.date.available2012-06-27T17:00:46Z
dc.date.issued2012
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/10605
dc.description.abstractThis thesis concerns a recently developed method for exact enumeration of self-avoiding walks, called the length-doubling algorithm. This method was created by the author and the supervisors and it substantially improves the current methods for the exact enumeration of self-avoiding walks. The basis of the algorithm and the results for the simple cubic lattice are given in the article [2]. This thesis reiterates the basis of the algorithm with slightly different terminology, and provides a more in-depth look at the implementation of the algorithm. It also adds the results of the face-centered cubic (FCC) and body- centered cubic (BCC) lattice, which are as of today yet unpublished.
dc.description.sponsorshipUtrecht University
dc.format.extent561811 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleExact enumeration of self-avoiding walks
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.courseuuMathematical Sciences


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record