ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers L≥N≥1L\ge N\ge1, let P\mathcal{P} be any nearest-neighbor monotonic path in Zd\mathbb{Z}^d of length NN, and let {Xn}n≥0\{X_n\}_{n\ge0} be a dd-dimensional simple random walk starting at 00. Define the straight coordinate-axis path

P→=((0,0,…,0),(1,0,…,0),…,(N−1,0,…,0)).\overset{\rightarrow}{\mathcal{P}}=\big((0,0,\ldots,0),(1,0,\ldots,0),\ldots,(N-1,0,\ldots,0)\big).

Axis-minimization conjecture.

P(Trace(P)⊆Trace(X0,…,XL))≥P(P→⊆Trace(X0,…,XL)).P\big({\rm Trace}(\mathcal{P})\subseteq {\rm Trace}(X_0,\ldots,X_L)\big)\ge P\big(\overset{\rightarrow}{\mathcal{P}}\subseteq {\rm Trace}(X_0,\ldots,X_L)\big).

Thus, among monotonic paths of length NN, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.