19 citations · 48 across the 7 of their papers we have counts for
1 paper · 2 filters
Nobu C. Shirai, Macoto Kikuchi
Counting the number of N-step self-avoiding walks (SAWs) on a lattice is one of the most difficult problems of enumerative combinatorics. Once we give up calculating the exact numb…