A note on the relation between Hartnell's firefighter problem and growth of groups

From MaRDI portal
Publication:6281752

DOI10.5802/TSG.314arXiv1701.02614WikidataQ129268886 ScholiaQ129268886MaRDI QIDQ6281752FDOQ6281752


Authors: Eduardo Martínez-Pedroza Edit this on Wikidata


Publication date: 10 January 2017

Abstract: The firefighter game problem on locally finite connected graphs was introduced by Bert Hartnell. The game on a graph G can be described as follows: let fn be a sequence of positive integers; an initial fire starts at a finite set of vertices; at each (integer) time ngeq1, fn vertices which are not on fire become protected, and then the fire spreads to all unprotected neighbors of vertices on fire; once a vertex is protected or is on fire, it remains so for all time intervals. The graph G has the emph{fn-containment property} if every initial fire admits an strategy that protects fn vertices at time n so that the set of vertices on fire is eventually constant. If the graph G has the containment property for a sequence of the form fn=Cnd, then the graph is said to have emph{polynomial containment}. In [5], it is shown that any locally finite graph with polynomial growth has polynomial containment; and it is remarked that the converse does not hold. That article also raised the question of whether the equivalence of polynomial growth and polynomial containment holds for Cayley graphs of finitely generated groups. In this short note, we remark how the equivalence holds for elementary amenable groups and for non-amenable groups from results in the literature.













This page was built for publication: A note on the relation between Hartnell's firefighter problem and growth of groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281752)