Axis-minimization conjecture for monotonic path covering
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.