Spillover and the lonely runner problem

Series
Additional Talks and Lectures
Time
Friday, November 20, 2026 - 11:00am for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Yifan Jing – Ohio State University
Organizer
Ernie Croot and Cosmin Pohoata

The lonely runner conjecture asserts that, for any n distinct positive integers v_1, \dots, v_n, there is a real number t such that 

\min_{1\leq i \leq n} \| tv_i\| \geq \frac{1}{n+1}. 

An elementary argument gives the lower bound 1/2n. In this talk I will present a uniform improvement (1+c)/2n, for an absolute constant c>0. The proof combines geometry and arithmetic arguments. We consider family of intervals from the speed set and study the level sets of their multiplicative function. The random case is controlled by a spillover inequality, and the structured case is handled by a result of Green and Walker on large GCD sums. Joint work with Xiyu Hu.