View-obstruction: a shorter proof for 6 lonely runners (Q1886345): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2004.06.008 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Yaochen Zhu / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56766746 / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Yaochen Zhu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2125641832 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Untere Schranken für zwei diophantische Approximations-Funktionen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Flows, view obstructions, and the lonely runner / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Six lonely runners / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: View-obstruction problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: View-obstruction problems in \(n\)-dimensional geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: View-Obstruction Problems. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: View-obstruction problems. III / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/dm/Renault04 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2004.06.008 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:44, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | View-obstruction: a shorter proof for 6 lonely runners |
scientific article |
Statements
View-obstruction: a shorter proof for 6 lonely runners (English)
0 references
18 November 2004
0 references
The lonely runner conjecture (see, for example, \textit{W. Bienia}, \textit{L. Goddyn}, \textit{P. Gvozdjak}, \textit{A. Sebö} and \textit{M. Tarsi} [J. Comb. Theory, Ser. B 72, No. 1, 1--9 (1998; Zbl 0910.05064)]) can be stated as follows: Let \(v_1,\dots, v_s\) be positive integers. There is a real number \(t\) such that \(\{tv_i\}\in [1/(s+ 1),s/(s+ 1)]\) for all \(i\in \{1,\dots, s\}\). It is well-known that it is true for \(s= 2,3,4,5\). In the present paper, the author gives a new proof of this conjecture for the case \(s= 5\), basing on a careful study of the different congruence classes modulo 6 of the numbers \(v_1,\dots, v_5\). Moreover, the author also gives very simple and elementary proofs for the cases \(s= 2,3,4\).
0 references
Lonely runner conjecture
0 references
View-obstruction
0 references