Enumerating self-avoiding walks by k-splitting
| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Groenland, C.E. | |
| dc.contributor.author | Groot, Marloes de | |
| dc.date.accessioned | 2025-04-03T14:01:22Z | |
| dc.date.available | 2025-04-03T14:01:22Z | |
| dc.date.issued | 2025 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/48786 | |
| dc.description.abstract | In this thesis we introduce a new method to count the number of self-avoiding walks of a certain length. This method is called k-splitting and is based on the length-doubling en length-tripling method. The k-splitting method combines k self-avoiding walks of length n to count the number of self-avoiding walks of length kn. We also discuss the tree data structure used to implement the length-doubling method. | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | EN | |
| dc.subject | In this thesis we introduce a new method to count the number of self-avoiding walks of a certain length. This method is called k-splitting and is based on the length-doubling en length-tripling method. The k-splitting method combines k self-avoiding walks of length n to count the number of self-avoiding walks of length kn. We also discuss the tree data structure used to implement the length-doubling method. | |
| dc.title | Enumerating self-avoiding walks by k-splitting | |
| dc.type.content | Bachelor Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | self-avoiding walks; k-splitting | |
| dc.subject.courseuu | Wiskunde | |
| dc.thesis.id | 19021 |
