Related papers: A Fire Fighter's Problem
We consider the complexity of the firefighter problem where b>=1 firefighters are available at each time step. This problem is proved NP-complete even on trees of degree at most three and budget one (Finbow et al.,2007) and on trees of…
It is well known in the combustion community that curvature effect in general slows down flame propagation speeds because it smooths out wrinkled flames. However, such a folklore has never been justified rigorously. In this paper, as the…
We consider random dynamics on a uniform random recursive tree with $n$ vertices. Successively, in a uniform random order, each edge is either set on fire with some probability $p_n$ or fireproof with probability $1-p_n$. Fires propagate in…
Flame Propagation is used as a prototypical example of expanding fronts that wrinkle without limit in radial geometries but reach a simple shape in channel geometry. We show that the relevant scaling laws that govern the radial growth can…
We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either inflammable, fireproof, or burt. Every inflammable edge is replaced by a fireproof edge at unit rate, while fires start at…
This paper presents a numerical investigation into the phenomenon of flame spread over thin circular ducts in normal gravity and microgravity environments. Flame spread over such geometry is of significant interest due to its relevance in…
Premixed flames propagating within small channels show complex combustion phenomena that differ from flame propagation at conventional scales. Available experimental and numerical studies have documented stationary/non-stationary and/or…
Resolving fluid transport at engine surfaces is required to predict transient heat loss, which is becoming increasingly important for the development of high-efficiency internal combustion engines (ICE). The limited number of available…
We consider a simple scalar reaction-advection-diffusion equation with ignition-type nonlinearity and discuss the following question: What kinds of velocity profiles are capable of quenching any given flame, provided the velocity's…
We study a one-dimensional free-boundary problem describing the penetration of carbonation fronts (free reaction-triggered interfaces) in concrete. A couple of decades ago, it was observed experimentally that the penetration depth versus…
We study planar curves defined by finite Fourier series of the form $F_n(t)=\sum_{p\le n} v_p(n!)\, e^{i p t}$, where the frequencies are the prime numbers and $v_p(n!)$ denotes the exponent of the prime $p$ in the factorization of $n!$. We…
The present paper seeks to determine the mechanism of flame acceleration and transition to detonation when a turbulent flame preceded by a shock interacts with a single obstruction in its path, taken as a cylindrical obstacle or a wall in…
We consider the so-called one-dimensional forest fire process. At each site of $\mathbb{Z}$, a tree appears at rate $1$. At each site of $\mathbb{Z}$, a fire starts at rate ${\lambda}>0$, immediately destroying the whole corresponding…
This letter addresses the constraint compatibility problem of control barrier functions (CBFs), which occurs when a safety-critical CBF requires a system to apply more control effort than it is capable of generating. This inevitably leads…
In the Firefighter problem, a fire breaks out at a vertex of a graph and at each subsequent time step, the firefighter chooses a vertex to protect and then the fire spreads from each burned vertex to every unprotected neighbour. The problem…
This paper is devoted to the study of travelling fronts of reaction-diffusion equations with periodic advection in the whole plane $\mathbb R^2$. We are interested in curved fronts satisfying some "conical" conditions at infinity. We prove…
It was demonstrated recently in Bychkov et al., Phys. Rev. Lett. 101 (2008) 164501, that the physical mechanism of flame acceleration in channels with obstacles is qualitatively different from the classical Shelkin mechanism. The new…
In 2016, Bonato, Janssen, and Roshanbin introduced graph burning as a discrete process that models the spread of social contagion. Although the burning process is a simple algorithm, the problem of determining the least number of rounds…
Consider a fully-connected synchronous distributed system consisting of $n$ nodes, where up to $f$ nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous $C$-counting problem, all nodes need to…
The Firefighter Problem (FP) is a graph problem originally introduced in 1995 to model the spread of a fire in a graph, which has attracted considerable attention in the literature. The goal is to devise a strategy to employ a given…