Winding of simple walks on the square lattice
Timothy Budd

TL;DR
This paper introduces a method to count simple walks on the square lattice with fixed winding angles using operator eigenvalue decomposition, enabling enumeration of walks in cones and analysis of winding distributions.
Contribution
The paper develops a novel operator-based approach to enumerate and analyze simple walks with fixed winding angles, including walks in cones and related probabilistic distributions.
Findings
Explicit generating functions for walks in cones starting and ending at the origin.
Identification of hyperbolic secant laws in winding angle distributions.
Connection between operator spectra and enumeration of closed loops with fixed winding.
Abstract
A method is described to count simple diagonal walks on with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller pieces, the generating functions of which are encoded in a commuting set of Hilbert space operators. The general enumeration problem is then solved by obtaining an explicit eigenvalue decomposition of these operators involving elliptic functions. By further restricting the intermediate winding angles of the walks to some open interval, the method can be used to count various classes of walks restricted to cones in of opening angles that are integer multiples of . We present three applications of this main result. First we find an explicit generating function for the walks in such cones that start and end at the origin. In the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
