Answers are grounded in this paper and cite their sources.
The authors consider the number of self-avoiding walks confined to a subset Z d (f) of the d-dimensional hypercubic lattice Z d , such that the coordinates (x 1 , x2 , . . .,x d ) of each vertex in the walk satisfy x 1 >or=0 and 0
No takes yet. Share an insight, caveat, or question.
Hammersley et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: