So, I've been reading about the lonely runner conjecture, but I have to admit that my knowledge of diophantine approximation is so limited that I wouldn't be able to properly explain the term.

So let's consider the simplest case, which is $n$ "real" "linear" runners in a circle ($=\mathbb R/\mathbb Z$).

Let me try and view this problem from the angle of equidistribution on tori; I don't know a lot about this subject either, but I think I remember having read about this in a book by Tao when the library was still open (ie. before Corona). So suppose we got $n$ runners with speeds $v_1, \ldots, v_n$. Choose a $t > 0$ such that $α := t (v_1, \ldots, v_n)$ has only irrational components. Then the sequence $x_n := nα$ should be equidistributed on the $n$-torus, and therefore we should be able to approximate any configuration of runners by choosing a point within the $n$-torus and using equidistribution.

I'm only vaguely familiar with the case of polynomials, but this should in principle generalise to polynomial functions under certain assumptions on the leading coefficient, right?

Is this approximately how one would approach the problem from that angle? Is there any reference?

I'd be enormously grateful for any comments on this matter.

Thank you very much in advance.

EDIT: Based on the comment by Mr. Myerson, I've posted a proof attempt here:

https://mathoverflow.net/questions/415319/is-this-a-proof-of-the-lonely-runner-conjecture

So, I've been reading about the lonely runner conjecture, but I have to admit that my knowledge of diophantine approximation is so limited that I wouldn't be able to properly explain the term.

So let's consider the simplest case, which is $n$ "real" "linear" runners in a circle ($=\mathbb R/\mathbb Z$).

Let me try and view this problem from the angle of equidistribution on tori; I don't know a lot about this subject either, but I think I remember having read about this in a book by Tao when the library was still open (ie. before Corona). So suppose we got $n$ runners with speeds $v_1, \ldots, v_n$. Choose a $t > 0$ such that $α := t (v_1, \ldots, v_n)$ has only irrational components. Then the sequence $x_n := nα$ should be equidistributed on the $n$-torus, and therefore we should be able to approximate any configuration of runners by choosing a point within the $n$-torus and using equidistribution.

I'm only vaguely familiar with the case of polynomials, but this should in principle generalise to polynomial functions under certain assumptions on the leading coefficient, right?

Is this approximately how one would approach the problem from that angle? Is there any reference?

I'd be enormously grateful for any comments on this matter.

Thank you very much in advance.

So, I've been reading about the lonely runner conjecture, but I have to admit that my knowledge of diophantine approximation is so limited that I wouldn't be able to properly explain the term.

So let's consider the simplest case, which is $n$ "real" "linear" runners in a circle ($=\mathbb R/\mathbb Z$).

Let me try and view this problem from the angle of equidistribution on tori; I don't know a lot about this subject either, but I think I remember having read about this in a book by Tao when the library was still open (ie. before Corona). So suppose we got $n$ runners with speeds $v_1, \ldots, v_n$. Choose a $t > 0$ such that $α := t (v_1, \ldots, v_n)$ has only irrational components. Then the sequence $x_n := nα$ should be equidistributed on the $n$-torus, and therefore we should be able to approximate any configuration of runners by choosing a point within the $n$-torus and using equidistribution.

I'm only vaguely familiar with the case of polynomials, but this should in principle generalise to polynomial functions under certain assumptions on the leading coefficient, right?

Is this approximately how one would approach the problem from that angle? Is there any reference?

I'd be enormously grateful for any comments on this matter.

Thank you very much in advance.

So, I've been reading about the lonely runner conjecture, but I have to admit that my knowledge of diophantine approximation is so limited that I wouldn't be able to properly explain the term.

So let's consider the simplest case, which is $n$ "real" "linear" runners in a circle ($=\mathbb R/\mathbb Z$).

Let me try and view this problem from the angle of equidistribution on tori; I don't know a lot about this subject either, but I think I remember having read about this in a book by Tao when the library was still open (ie. before Corona). So suppose we got $n$ runners with speeds $v_1, \ldots, v_n$. Choose a $t > 0$ such that $α := t (v_1, \ldots, v_n)$ has only irrational components. Then the sequence $x_n := nα$ should be equidistributed on the $n$-torus, and therefore we should be able to approximate any configuration of runners by choosing a point within the $n$-torus and using equidistribution.

I'm only vaguely familiar with the case of polynomials, but this should in principle generalise to polynomial functions under certain assumptions on the leading coefficient, right?

Is this approximately how one would approach the problem from that angle? Is there any reference?

I'd be enormously grateful for any comments on this matter.

Thank you very much in advance.

EDIT: Based on the comment by Mr. Myerson, I've posted a proof attempt here:

https://mathoverflow.net/questions/415319/is-this-a-proof-of-the-lonely-runner-conjecture