jcreed on Nostr: npub1c9m22…z9xjd npub13t0vx…qvj4p I also find these questions very compelling. ...

npub1c9m22hkc5h6zgrwkz48crhcpw6vch2rf6j97746ugl3neys86jeqyz9xjd (npub1c9m…9xjd) npub13t0vxvx8llrdglujal9hh93mtnl7wac0mxqd7xtdyryc4per8q4qtqvj4p (npub13t0…vj4p) I also find these questions very compelling. Also: in the limit of large n, the number of discrete n-step paths of length n from the origin to a point p only depends on the Cartesian distance to p. So shouldn't there be some kind of combinatorially meaningful approximate bijection between the paths that end at, e.g. (5,0) and (3,4)?

I definitely don't know exactly what I mean by "approximate bijection". Finding a suitable notion is the heart of the question.