Enumerating self-avoiding walks by k-splitting

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.