On the Minimum Speed for a Fire Blocking Problem

arXiv:2610.36919 · math.OC · Submitted 2026-10-27 · Read on arXiv

math.OC

Submitted: 2026-10-27

Updated: 2026-10-27

License: http://creativecommons.org/licenses/by/4.0/

The gist: We consider a dynamic blocking problem: a fire, starting on a bounded open set R 0 R squared, propagates in the plane with unit speed in all directions.

Abstract

We consider a dynamic blocking problem: a fire, starting on a bounded open set R 0 R squared, propagates in the plane with unit speed in all directions. To block it, a barrier can be constructed in real time, at speed λ>0. A long standing conjecture by the first author states that the fire can be entirely surrounded by the barrier, in finite time, if and only if λ>2. The present paper improves on earlier lower bounds. Namely, if λ at most Λ=1.62621170228 we show that the fire cannot be blocked. We also prove that, if λ at most 2, the fire cannot be blocked by constructing a barrier which is a simple closed curve. More precisely, if the barrier does not contain purely delaying arcs, i.e. arcs which are eventually surrounded by the fire on both sides, then for λ<2 the region burned by the fire at time t>0 has area A(t)>(2-λ)t 2/4.

Related papers