Escaping an Infinitude of Lions

Abstract

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+\epsilon$ for some value $\epsilon >0$. Can the man survive? We answer the question in the affirmative for any $\epsilon >0$.

Published in American Mathematical Monthly, but references [5] and [10] are new. Note added about this. For a preliminary version, see arXiv:1703.03687

References in corpus (1)

• Escaping an Infinitude of Lions

Cited by in corpus (1)

• Escaping an Infinitude of Lions