Enumerating Up-Side Self-Avoiding Walks on Integer Lattices

DSpace/Manakin Repository

Enumerating Up-Side Self-Avoiding Walks on Integer Lattices

Citable link to this page

 

 
Title: Enumerating Up-Side Self-Avoiding Walks on Integer Lattices
Author: Williams, Lauren
Citation: Williams, Lauren K. 1996. Enumerating up-side self-avoiding walks on integer lattices. Electronic Journal of Combinatorics 3(1): #R31.
Full Text & Related Files:
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.
Published Version: http://www.combinatorics.org/Volume_3/volume3.html#R31
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#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2624680
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters