Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Add to Chrome
Add to Firefox
Add to EdgeEscaping an Infinitude of Lions
Paper and Code
Dec 21, 2020
We consider the following game played in the Euclidean plane: There is any countable set of unit speed lions and one fast man who can run with speed $1+\varepsilon$ for some value $\varepsilon>0$. Can the man survive? We answer the question in the affirmative for any $\varepsilon>0$.
* Am. Math. Mon., 2020, 127(10): 880-896 * Published in American Mathematical Monthly, but references [5] and
[10] are new. For a preliminary version, see arXiv:1703.03687
View paper on