Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-22T04:22:43.207Z Has data issue: false hasContentIssue false

Partition Functions and Spiralling in Plane Random Walk

Published online by Cambridge University Press:  20 November 2018

Z.A. Melzak*
Affiliation:
McGillUniversity
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Consider the plane symmetric random walk on a square lattice: a particle is initially at the origin in the xy-plane, it makes n consecutive steps of unit length, and each step is made with the probability 1/4 in each one of the four directions parallel to the axes. We call the path of the particle a spiral if the following conditions are met: a) the particle never occupies the same position twice, b) the path of the particle, whenever it turns, either turns always clockwise or always counter-clockwise throughout the path, and c) for every m > n the given n-step path can be continued in atleast one way to give an m-step path meeting the conditions.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1963

References

1. Hardy, G. H. and Wright, E. M., The Theory of Numbers, 2nd edition, Oxford 1945.Google Scholar