Related papers: Problems on Track Runners
The Lonely Runner Conjecture of Wills and Cusick states that if $k+1$ runners start running at distinct constant speeds around a unit-length circular track, then for each runner there is a time when he/she is at least $1/(k+1)$ away from…
The lonely runner conjecture, now over fifty years old, concerns the following problem. On a unit length circular track, consider $m$ runners starting at the same time and place, each runner having a different constant speed. The conjecture…
Suppose $k+1$ runners having nonzero constant speeds run laps on a unit-length circular track starting at the same time and place. A runner is said to be lonely if she is at distance at least $1/(k+1)$ along the track to every other runner.…
The Lonely Runner Conjecture asserts that if $n$ runners with distinct constant speeds run on the unit circle $\mathbb{R}/\mathbb{Z}$ starting from $0$ at time $0$, then each runner will at some time $t>0$ be lonely in the sense that she/he…
Suppose that $k$ runners having different constant speeds run laps on a circular track of unit length. The Lonely Runner Conjecture states that, sooner or later, any given runner will be at distance at least $1/k$ from all the other…
The Lonely Runner Conjecture states that if $k+1$ runners start at the same point on a unit-length circular track and run with distinct constant speeds, then each runner is at some time at least $1/(k+1)$-distant from every other runner.…
The lonely runner conjecture of Wills and Cusick, in its most popular formulation, asserts that if $n$ runners with distinct constant speeds run around a unit circle ${\bf R}/{\bf Z}$ starting at a common time and place, then each runner…
Consider $n$ runners running on a circular track of unit length with constant speeds such that $k$ of the speeds are distinct. We show that, at some time, there will exist a sector $S$ which contains at least $|S|n+ \Omega(\sqrt{k})$…
In this paper, we study the distribution of the boundary points of expansion. As an application, we say something about the lonely runner problem. We show that given $k$ runners $\mathcal{S}_i$ round a unit circular track with the condition…
In order to determine the optimal strategy to run a race on a curved track according to the lane number, we introduce a model based on differential equations for the velocity, the propulsive force and the anaerobic energy which takes into…
We consider (n+1) runners with given constant unique integer speeds running along the circumference of a circle whose circumferential length is one, and all runners starting from the same point. We define and give lower bounds to a first…
The Lonely Runner Conjecture was posed independently by Wills and Cusick and has many applications in different mathematical fields, such as diophantine approximation. This well-known conjecture states that for any set of runners running…
In this article the pursuit problem of objects that moves with different accelerations and initial speeds is studied. Initially, the situation in which the escaping object moves in a straight line is considered. Under this condition, and if…
The lonely runner conjecture of Wills and Cusick asserts that if $n$ runners with distinct constant speeds run around a a circular unit length track, starting at a common time and place, then each runner will at some time be separated by a…
We address the problem of tracking and detecting interactions between the different groups of runners that form during a race. In athletic races control points are set to monitor the progress of athletes over the course. Intuitively, a {\it…
All experiments attempting to verify the invariance of speed of light directly are based on two-way speed measurement. The challenge in one-way speed measurement, the requirement of spatially separated synchronised clocks, can be possibly…
The aim of this paper is to bring a mathematical justification to the optimal way of organizing one's effort when running. It is well known from physiologists that all running exercises of duration less than 3mn are run with a strong…
Our aim is to present a new model which encompasses pace optimization and motor control effort for a runner on a fixed distance. We see that for long races, the long term behaviour is well approximated by a turnpike problem. We provide…
In contrast to set-point tracking which aims to reduce the tracking error between the tracker and the reference, tracking-in-range problems only focus on whether the tracker is within a given range around the reference, making it more…
Runners competing in races are looking to optimize their performance. In this paper, a runner's performance in a race, such as a marathon, is formulated as an optimal control problem where the controls are: the nutrition intake throughout…