BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1587
DTSTAMP:20250916T044349Z
SUMMARY:Oh the lonely runner!
DESCRIPTION:Speaker: Avinash Bhardwaj (IIT Bombay)\n\nAbstract: \nLonely Ru
 nner Conjecture\, proposed by Jörg M. Wills and so nomenclatured by Luis 
 Goddyn\, has been an object of interest since it was first conceived in 19
 67: Given positive integers k and n1\,n2\,...\,nk there exists a positive 
 real number t such that the distance of t·nj to the nearest integer is at
  least 1\\(k+1)\, ∀ 1 ≤ j ≤ k. The problem that originated in Diopha
 ntine approximation almost 6 decades ago\, is still widely open. Through t
 his talk I will attempt to share some interesting insights that have flown
  through academic circles over the long steady life of the problem\, along
  with some new key results.\nShort Bio:Avinash Bhardwaj is presently a fac
 ulty member in the Department of Industrial Engineering and Operations Res
 earch at IIT Bombay. His research interests broadly span mathematical opti
 mization with particular interests in discrete and combinatorial optimizat
 ion.\n
URL:https://www.tcs.tifr.res.in/web/events/1587
DTSTART;TZID=Asia/Kolkata:20250916T160000
DTEND;TZID=Asia/Kolkata:20250916T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR