Publication: Enumerating Up-Side Self-Avoiding Walks on Integer Lattices
Open/View Files
Date
1996
Authors
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
International Press (Cambridge, MA)
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Williams, Lauren K. 1996. Enumerating up-side self-avoiding walks on integer lattices. Electronic Journal of Combinatorics 3(1): #R31.
Research Data
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.
Description
Other Available Sources
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service