Develin–Hartke conjecture on subcritical containment in square grids

From papers

Let dd be a positive integer, let Ld\mathbb{L}^d denote the dd-dimensional square grid, and let f ⁣:NRf\colon\mathbb{N}\to\mathbb{R} satisfy

f(t)td20\frac{f(t)}{t^{d-2}}\longrightarrow 0

as tt tends to infinity. An outbreak is a fire spreading through the vertices of Ld\mathbb{L}^d, and deploying f(t)f(t) firefighters at time tt means that at most that many vertices can be protected at that time.

Develin–Hartke conjecture. There exists an outbreak on Ld\mathbb{L}^d that cannot be contained by deploying f(t)f(t) firefighters at time tt.

The claim predicts that any deployment rate asymptotically smaller than td2t^{d-2} fails to contain some outbreak. The source notes a weaker version in which f(t)f(t) is required to be a polynomial, and presents a corollary proving the polynomial case.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Danny Dyer, Eduardo Martinez-Pedroza and Brandon Thorne, “The Coarse Geometry of Hartnell's Firefighter Problem on Infinite Graphs”, arXiv:1507.03050 (2017).

Solutions 0

No solutions have been posted yet.