BEGIN:VCALENDAR
VERSION:2.0
X-WR-CALNAME;VALUE=TEXT:Seminar: Jacob Fox (Stanford University): "Subset Sums"
PRODID:-//Harvard events data//EN
BEGIN:VEVENT
UID:event_1801951_0
SUMMARY:Seminar: Jacob Fox (Stanford University): "Subset Sums"
DESCRIPTION:<p>	<drupal-media data-entity-type="media" data-entity-uuid="348d059d-63ae-4506-adbb-acbb62ecdb05" alt="Jacob Fox" data-view-mode="hwp_small"></drupal-media></p><p>	Zoom link: https://harvard.zoom.us/j/779283357?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09<br>Passcode: 657361<br>Speaker: Jacob Fox (Stanford University)<br>Title: Subset Sums<br>Abstract: In this talk, I will discuss novel techniques which allow us to prove a diverse range of results on representing integers as subset sums, including solutions to many long-standing open problems in the area. For example, we answer a question of Alon and Erdős on the minimum number of colors needed to color the positive integers less than n so that n cannot be written as a monochromatic sum. Based on joint work with David Conlon and Huy Tuan Pham. Time permitting, we will discuss some of the remaining outstanding open problems on subset sums and connections to other areas of mathematics and computer science.</p>
LOCATION:Jefferson 368 and Zoom
STATUS:CONFIRMED
DTSTART:20240220T213000Z
DTEND:20240220T223000Z
END:VEVENT
END:VCALENDAR