Lonely runners and their spectra

Add to your list(s) Download to your calendar using vCal

• Noah Kravitz (Oxford)
• Thursday 23 October 2025, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

Dirichlet’s Theorem from Diophantine approximation says that for any real number t, there is some v in {1,2,...,n} such that tv lies within 1/(n+1) of an integer. The Lonely Runner Conjecture of Wills and Cusick asserts that the constant 1/(n+1) in this theorem cannot be improved by replacing {1,2,...,n} with a different set of n nonzero real numbers. The conjecture, although now more than 50 years old, remains wide open for n larger than 7. In this talk I will describe a new approach based on the “Lonely Runner spectra” that arise when one considers the “inverse problem” for the Lonely Runner Conjecture. Based on joint work with Vikram Giri and with Vanshika Jain.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.