The Lamplighter groups have infinite weak cop number
Anders Cornect, Eduardo Mart\'inez-Pedroza

TL;DR
This paper investigates the weak-cop number in infinite, vertex transitive graphs, proving that certain Cayley graphs, including those of wreath products and Thompson's group F, have infinite weak-cop number.
Contribution
It establishes that Cayley graphs of wreath products and Thompson's group F possess infinite weak-cop number, advancing understanding of pursuit-evasion dynamics in exotic infinite graphs.
Findings
Cayley graphs of wreath products have infinite weak-cop number
Thompson's group F Cayley graphs also have infinite weak-cop number
Introduces a new pursuit and evasion game for analysis
Abstract
The weak-cop number of a graph, a variation of the cop number, is an invariant suitable for infinite graphs and is a quasi-isometric invariant. While for any there exist locally finite infinite graphs with weak-cop number , it is an open question whether there exists locally finite vertex transitive graphs whose weak-cop number is different than and . We test this question on Cayley graphs of wreath products, these are objects known for their exotic geometries. We prove that Cayley graphs of wreath products of nontrivial groups by infinite groups have infinite weak-cop number. The result is proved by defining a new pursuit and evasion game and proving the existence of strategies for the evader. We also include a short argument that Cayley graphs of Thompson's group have infinite weak cop number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Rings, Modules, and Algebras · semigroups and automata theory
