ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For R∈NR\in\mathbb{N}, let fR(n)f_R(n) be the minimum number of cops needed to catch a robber of speed RR on an n×nn\times n grid, where the cops move at unit speed. Here “sufficiently large” refers to the robber speed parameter RR.

Fast-robber grid conjecture. For all sufficiently large R∈NR\in\mathbb{N},

fR(n)=n1−o(1)as n→∞.f_R(n)=n^{1-o(1)}\quad\text{as }n\to\infty.

The conjecture says that, for sufficiently large fixed robber speeds, the trivial upper bound fR(n)≤nf_R(n)\le n is asymptotically close to the truth. The paper proves a much weaker exponential lower bound for one sufficiently large speed and leaves this near-linear behaviour conjectural.

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.