Axis-minimization conjecture for monotonic path covering
For integers , let be any nearest-neighbor monotonic path in of length , and let be a -dimensional simple random walk starting at . Define the straight coordinate-axis path
Axis-minimization conjecture.
Thus, among monotonic paths of length , the covering probability is conjectured to be minimized by a straight path along a coordinate axis. The source presents this as an additional conjecture, with no resolution supplied.
References
- Eviatar B. Procaccia and Yuan Zhang, “On Covering Monotonic Paths with Simple Random Walk”, arXiv:1704.05870 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.