Lonely runners in function fields

Abstract

The lonely runner conjecture, now over fifty years old, concerns the following problem. On a unit length circular track, consider $m$ runners starting at the same time and place, each runner having a different constant speed. The conjecture asserts that each runner is lonely at some point in time, meaning distance at least $1/m$ from the others. We formulate a function field analogue, and give a positive answer in some cases in the new setting.

References in corpus (3)

• Upper bounds for sunflower-free sets
• Dirichlet's Theorem in function fields
• A new upper bound for the size of a sunflower-free family