Visible lattice points in higher dimensional random walks and biases among them
Abstract
For any integers k≥ 2, q≥ 1 and any finite set A=\α1,·s,αq\, where αt=(αt,1,·s,αt,k)~(1≤ t≤ q) with 0<αt,1,·s,αt,k<1 and αt,1+·s+αt,k=1, this paper concerns the visibility of lattice points in the type-A random walk on the lattice Zk. We show that the proportion of visible lattice points on a random path of the walk is almost surely 1/ζ(k), where ζ(s) is the Riemann zeta-function, and we also consider consecutive visibility of lattice points in the type-A random walk and give the proportion of the corresponding visible steps. Moreover, we find a new phenomenon that visible steps in both of the above cases are not evenly distributed. Our proof relies on tools from probability theory and analytic number theory.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.