Invisible runners in finite fields

2008/04/04 by Sebastian Czerwiński, Jarosław Grytczuk · 6 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Computer science #Limits and Structures in Graph Theory #Mathematics #Theoretical computer science

paper · open access · doi:10.1016/j.ipl.2008.03.019

published in Information Processing Letters 108(2), 64-67 (Elsevier BV)

openalex publication_date 2008/04/04 · crossref created 2008/04/04 · crossref issued 2008/09/01 · crossref published 2008/09/01 · crossref published-print 2008/09/01 · crossref deposited 2018/12/30 · crossref indexed 2025/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Citations

• Flows, View Obstructions, and the Lonely Runner
• View-obstruction problems, III
• View-obstruction problems
• The View-Obstruction Problem forn-Dimensional Cubes
• View-obstruction: a shorter proof for 6 lonely runners
• Zwei S�tze �ber inhomogene diophantische Approximation von Irrationalzehlen

Cited by

• Random runners are very lonely
• The lonely runner problem for lacunary sequences
• Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
• Lonely runner conjecture [wikipedia]