Abstract

The Lonely Runner Conjecture, posed independently by Wills and by Cusick, states that for any set of runners running along the unit circle with constant different speeds and starting at the same point, there is a time where all of them are far enough from the origin. We study the correlation among the time that runners spend close to the origin. By means of these correlations, we improve a result of Chen on the gap of loneliness. In the last part, we introduce dynamic interval graphs to deal with a weak version of the conjecture thus providing a new result related to the invisible runner theorem of Czerwinski and Grytczuk.

Highlights

  • The Lonely Runner Conjecture was posed independently by Wills [22] in 1967 and Cusick [10] in 1982

  • The Lonely Runner Conjecture, posed independently by Wills and by Cusick, states that for any set of runners running along the unit circle with constant different speeds and starting at the same point, there is a time where all of them are far enough from the origin

  • We introduce dynamic interval graphs to deal with a weak version of the conjecture providing a new result related to the invisible runner theorem of Czerwinski and Grytczuk

Read more

Summary

Introduction

The Lonely Runner Conjecture was posed independently by Wills [22] in 1967 and Cusick [10] in 1982. This result was improved by Chen [7] who showed that, for every set of n nonzero speeds, there exists a time t ∈ R such that tvi. If 2n − 3 is a prime number, the previous result was extended by Chen and Cusick [8] In this case, these authors proved that, for every set of n speeds, there exists a time t ∈ R such that tvi. The last inequality holds under a natural density condition on the set of speeds which covers the more difficult cases where the speeds grow slowly Another interesting result on the Lonely Runner Conjecture, was given by Czerwinski and Grytczuk [13].

Correlation among runners
Improving the gap of loneliness
Weaker conjectures and interval graphs
Concluding remarks and open questions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.