Sharp covering-decay conjecture for short paths
Statement
Let , let be a nearest-neighbor path in connecting to , and write for its length. Let be a -dimensional simple random walk starting at .
Sharp covering-decay conjecture. There are an and a such that, for every and every such path satisfying ,
This would improve the theorem's upper bound for paths of length and yield nontrivial bounds for the chemical distance within a three-dimensional random-walk trace. The conjecture is presented as open; the paper notes that its proposed reflection argument cannot prove it.
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.