Enumerating up-side self-avoiding walks on integer lattices

MaRDI QIDQ1379176zbMATH OpenFDO

Authors Lauren K. Williams

Publication date 22 February 1998

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119230, http://www.emis.de/journals/EJC/Volume_3/volume3.html#R31

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generating functionslatticeself-avoiding walk

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

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.

Recommendations

• Self-avoiding walks and Fibonacci numbers
• COUNTING ALL SELF-AVOIDING WALKS ON A FINITE LATTICE STRIP OF WIDTH ONE
• Self-avoiding walks on lattice strips
• Counting all unfolded self-avoiding walks on a finite lattice strip of width three
• Self-avoiding walks, the language of science, and Fibonacci numbers

Cited in

(11)

• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• Counting all self-avoiding walks on a finite lattice strip of width one and two
• Counting all unfolded self-avoiding walks on a finite lattice strip of width three
• On simple symmetric random walk in d-dimensional integer lattice
• COUNTING ALL SELF-AVOIDING WALKS ON A FINITE LATTICE STRIP OF WIDTH ONE
• scientific article; zbMATH DE number 6456216 (Why is no real title available?)
• Self-avoiding walks and Fibonacci numbers
• Self-avoiding walks of specified lengths on rectangular grid graphs
• Walks on tiled boards
• Markov chains, CAT(0) cube complexes, and enumeration: monotone paths in a strip mix slowly
• Step-constrained self-avoiding walks on finite grids

This page was built for publication: Enumerating up-side self-avoiding walks on integer lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379176)