DeepAI
Log In Sign Up

Escaping an Infinitude of Lions

12/21/2020
by   Mikkel Abrahamsen, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

05/06/2019

Geometric Firefighting in the Half-plane

In 2006, Alberto Bressan suggested the following problem. Suppose a circ...
10/01/2018

On the density of sets of the Euclidean plane avoiding distance 1

A subset A ⊂ R^2 is said to avoid distance 1 if: ∀ x,y ∈ A, x-y _2 ≠ 1....
06/29/2022

Minimum Weight Euclidean (1+ε)-Spanners

Given a set S of n points in the plane and a parameter ε>0, a Euclidean ...
06/07/2010

Game Information System

In this Information system age many organizations consider information s...
07/16/2021

On Vizing's edge colouring question

Soon after his 1964 seminal paper on edge colouring, Vizing asked the fo...
01/08/2013

Apollonian Circumcircles of IFS Fractals

Euclidean triangles and IFS fractals seem to be disparate geometrical co...
02/27/2019

Towards Efficient Data Valuation Based on the Shapley Value

"How much is my data worth?" is an increasingly common question posed by...