Enumerating Up-Side Self-Avoiding Walks on Integer Lattices
View/ Open
Author
Published Version
http://www.combinatorics.org/Volume_3/volume3.html#R31Metadata
Show full item recordCitation
Williams, Lauren K. 1996. Enumerating up-side self-avoiding walks on integer lattices. Electronic Journal of Combinatorics 3(1): #R31.Abstract
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. Though mathematicians have studied saws for over fifty years, the number of n-step saws is unknown. This paper examines a special case of this problem, finding the number of n-step "up-side'' saws (ussaws), saws restricted to moving up and sideways. It presents formulas for the number of n-step ussaws on various lattices, found using generating functions with decomposition and recursive methods.Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:2624680
Collections
- FAS Scholarly Articles [18292]
Contact administrator regarding this item (to report mistakes or request changes)