Counting all self-avoiding walks on a finite lattice strip of width one and two

DOI10.1216/RMJ-2018-48-2-573zbMath1388.05015OpenAlexW2806199768MaRDI QIDQ1638050

Michael A. Nyblom

Publication date: 12 June 2018

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.rmjm/1528077634

zbMATH Keywords

self-avoiding walkfolded walkunfolded walk

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items

Self-avoiding walks of specified lengths on rectangular grid graphs ⋮ Counting all unfolded self-avoiding walks on a finite lattice strip of width three

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerating up-side self-avoiding walks on integer lattices
• Self-avoiding walks, the language of science, and Fibonacci numbers
• COUNTING ALL SELF-AVOIDING WALKS ON A FINITE LATTICE STRIP OF WIDTH ONE
• Self-avoiding polygons and walks in slits
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE