Correlation among runners and some results on the lonely runner conjecture (Q278889): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Summary: The lonely runner conjecture, posed independently by J. M. Wills and by T. W. 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 \textit{S. Czerwinski} and \textit{J. Grytczuk} [Inf. Process. Lett. 108, No. 2, 64--67 (2008; Zbl 1191.68448)].
Property / review text: Summary: The lonely runner conjecture, posed independently by J. M. Wills and by T. W. 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 \textit{S. Czerwinski} and \textit{J. Grytczuk} [Inf. Process. Lett. 108, No. 2, 64--67 (2008; Zbl 1191.68448)]. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11J13 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11B75 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11J71 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6576596 / rank
 
Normal rank
Property / zbMATH Keywords
 
lonely runner conjecture
Property / zbMATH Keywords: lonely runner conjecture / rank
 
Normal rank

Revision as of 17:06, 27 June 2023

scientific article
Language Label Description Also known as
English
Correlation among runners and some results on the lonely runner conjecture
scientific article

    Statements

    Correlation among runners and some results on the lonely runner conjecture (English)
    0 references
    0 references
    0 references
    3 May 2016
    0 references
    Summary: The lonely runner conjecture, posed independently by J. M. Wills and by T. W. 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 \textit{S. Czerwinski} and \textit{J. Grytczuk} [Inf. Process. Lett. 108, No. 2, 64--67 (2008; Zbl 1191.68448)].
    0 references
    lonely runner conjecture
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references