ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A scout process consists of cc scouts moving on Zd\mathbb{Z}^d according to a scout protocol P=⟨c,S,x0,q0,Π⟩\mathcal{P}=\langle c,\mathcal{S},x_0,\mathbf{q}_0,\Pi\rangle. The hitting time of x∈Zdx\in\mathbb{Z}^d is inf⁡{n≥0:∃i such that Xni=x}\inf\{n\geq 0:\exists i\text{ such that }X_n^i=x\}, and the protocol is effective when every grid point has finite mean hitting time. It is known that d+1d+1 scouts suffice for every d≥1d\geq 1.

The scout-number conjecture. For d≥3d\geq 3, any effective scout protocol on Zd\mathbb{Z}^d requires at least d+1d+1 scouts.

The claim extends the paper's theorem for d∈{1,2}d\in\{1,2\} and, together with the known sufficiency of d+1d+1 scouts, would identify the exact minimum number of scouts needed for effective exploration of Zd\mathbb{Z}^d.

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.