Inquiries about lonely runner conjecture

  • Context: High School 
  • Thread starter Thread starter Einstein's Cat
  • Start date Start date
  • Tags Tags
    Conjecture
Click For Summary
SUMMARY

The discussion centers on the Lonely Runner Conjecture, which posits that k runners, each with distinct speeds, can achieve a state of "loneliness" by maintaining a minimum distance of at least 1/k from each other. Participants confirm that "pairwise distinct" indeed refers to different speeds for each runner. It is established that runners can achieve loneliness independently of one another, and once a runner reaches this state, it remains even if the distance to others decreases below 1/k later on.

PREREQUISITES
  • Understanding of the Lonely Runner Conjecture
  • Familiarity with concepts of distance and speed in mathematical contexts
  • Knowledge of pairwise distinct elements in mathematics
  • Basic grasp of independent events in probability theory
NEXT STEPS
  • Research the mathematical proofs related to the Lonely Runner Conjecture
  • Explore the implications of distinct speeds in competitive scenarios
  • Study independent events in probability theory for deeper insights
  • Investigate related conjectures in combinatorial geometry
USEFUL FOR

Mathematicians, students studying combinatorial geometry, and anyone interested in the properties of competitive scenarios involving distinct speeds and distances.

Einstein's Cat
Messages
182
Reaction score
2
Here is the Wikipedia article on the lonely runner conjecture

https://en.m.wikipedia.org/wiki/Lonely_runner_conjecture#

I have some inquires about it.

Firstly I am right in thinking that "pair wise distinct" means that the speed of all runners are different?

Also does every runner have to be at least 1/k (k is the number of runners) from all the other runners simultaneously? Or can runners achieve "loneliness" at a certain time even whilst other runners have not?

Furthermore, once a runner achieves "loneliness" is it maintained? In other words say a runner is lonely, does it stay lonely even if the distance between it and the other runners decreases to become smaller than 1/k afterwards?
 
Last edited:
Mathematics news on Phys.org
Einstein's Cat said:
Firstly I am right in thinking that "pair wise distinct" means that the speed of all runners are different?
Yes. If two runners have the same speed, then they are never lonely, and the problem gets trivial.

Runners can achieve loneliness independent of other runners (otherwise the problem would be trivial again).
Einstein's Cat said:
Furthermore, once a runner achieves "loneliness" is it maintained? In other words say a runner is lonely, does it stay lonely even if the distance between it and the other runners decreases to become smaller than 1/k afterwards?
Sure.
 
  • Like
Likes   Reactions: Einstein's Cat

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 51 ·
2
Replies
51
Views
5K
Replies
9
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 21 ·
Replies
21
Views
3K
  • · Replies 71 ·
3
Replies
71
Views
7K