Lonely runners in function fields
Number Theory
2019-04-17 v2 Combinatorics
Abstract
The lonely runner conjecture, now over fifty years old, concerns the following problem. On a unit length circular track, consider 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 from the others. We formulate a function field analogue, and give a positive answer in some cases in the new setting.
Cite
@article{arxiv.1711.01207,
title = {Lonely runners in function fields},
author = {Sam Chow and Luka Rimanic},
journal= {arXiv preprint arXiv:1711.01207},
year = {2019}
}