Enumerating up-side self-avoiding walks on integer lattices
type: Item
instance of: scholarly article
title: Enumerating up-side self-avoiding walks on integer lattices
zbMATH Open document ID: 0885.05005
author: Lauren K. Williams
published in: The Electronic Journal of Combinatorics
publication date: 1998-02-22T00:00:00Z
full work available at URL: https://eudml.org/doc/119230
full work available at URL: R31
review text: 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.
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 1120245
zbMATH Keywords: self-avoiding walk
zbMATH Keywords: lattice
zbMATH Keywords: generating functions
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1120245