Enumerating up-side self-avoiding walks on integer lattices

zbMath0885.05005MaRDI QIDQ1379176

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

zbMATH Keywords

latticegenerating functionsself-avoiding walk

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (5)

Counting all self-avoiding walks on a finite lattice strip of width one and two ⋮ COUNTING ALL SELF-AVOIDING WALKS ON A FINITE LATTICE STRIP OF WIDTH ONE ⋮ Self-avoiding walks of specified lengths on rectangular grid graphs ⋮ The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. ⋮ Counting all unfolded self-avoiding walks on a finite lattice strip of width three

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