Enumerating up-side self-avoiding walks on integer lattices (Q1379176)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1120245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating up-side self-avoiding walks on integer lattices |
scientific article; zbMATH DE number 1120245 |
Statements
Enumerating up-side self-avoiding walks on integer lattices (English)
0 references
22 February 1998
0 references
Summary: 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.
0 references
self-avoiding walk
0 references
lattice
0 references
generating functions
0 references
0.778594434261322
0 references
0.7748697996139526
0 references
0.769451916217804
0 references
0.7631662487983704
0 references
0.7623125314712524
0 references
