Random runners are very lonely

Details Random runners are very lonely Random runners are very lonely

2011-02-22

arxiv.org/abs/1102.4464v2

Mathematics

Combinatorics

Scientific paper

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 runners. We prove that, with probability tending to one, a much stronger statement holds for random sets in which the bound $1/k$ is replaced by \thinspace $1/2-\varepsilon $. The proof uses Fourier analytic methods. We also point out some consequences of our result for colouring of random integer distance graphs.

Affiliated with

Also associated with

No associations

Rating

Random runners are very lonely does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random runners are very lonely, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random runners are very lonely will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558775