BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20231108T161500
DTEND;TZID=America/Los_Angeles:20231108T173000
DTSTAMP:20260620T102342
CREATED:20231020T213110Z
LAST-MODIFIED:20231020T213157Z
UID:3297-1699460100-1699464600@colleges.claremont.edu
SUMMARY:Lonely Runners and My Favorite Polyhedron (Matthias Beck\, San Francisco State University)
DESCRIPTION:Title: Lonely Runners and My Favorite Polyhedron \nSpeaker: Matthias Beck\, Department of Mathematics\, San Francisco State University \nAbstract: We study the Lonely Runner Conjecture\, conceived by Wills in the 1960’s\, and originally phrased in terms of Diophantine approximation: Given positive integers n_1\, n_2\, …\, n_k\, there exists a positive real number t such that for all 1 ≤ j ≤ k the distance of t n_j to the nearest integer is at least 1/(k+1). This conjecture can be recast in lay terms: if k runners with different (constant) speeds move around a circular track of length 1\, then for each runner there will be a time when they have distance at least 1/k to the others. This (in)famous conjecture in combinatorial number theory is open for k ≥ 7.We will give a brief history of the Lonely Runner Conjecture and some of its variants\, emphasizing a view-obstruction approach by Cusick and recent work by Henze and Malikiosis; our goal is to promote a polyhedral ansatz to the Lonely Runner Conjecture. Our results include affirmative instances that become (quite literally) visible through polyhedral geometry. \nBased on joint work with Serkan Hosten (SF State) and Matthias Schymura (Rostock). \n\n\n\n\n\nMatthias Beck is a professor of mathematics at San Francisco State University and has had visiting positions at SUNY Binghamton\, the Mathematical Sciences Research Institute in Berkeley\, the Max-Planck-Institute in Bonn\, Cornell University\, Vassar College\, and the Freie Universität in Berlin. Matt’s research is in combinatorics and number theory\, in particular\, counting integer points in polyhedra and the application of these enumeration functions to various mathematical topics and problems. He (co-)authored four books and numerous research papers\, many of which feature student coauthors. Matt was honored with the Mathematical Association of America’s Haimo Award for Distinguished College or University Teaching of Mathematics in 2013.x`
URL:https://colleges.claremont.edu/ccms/event/lonely-runners-and-my-favorite-polyhedron-matthias-beck-san-francisco-state-university/
LOCATION:Argue Auditorium\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
GEO:34.0999157;-117.7142668
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Argue Auditorium Pomona College 610 N. College Ave. Claremont CA 91711 United States;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142668,34.0999157
END:VEVENT
END:VCALENDAR